./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:47:48,003 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:47:48,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 11:47:48,065 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:47:48,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:47:48,097 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:47:48,098 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:47:48,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:47:48,099 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:47:48,099 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:47:48,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:47:48,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:47:48,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:47:48,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:47:48,102 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:47:48,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:47:48,103 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:47:48,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:47:48,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:47:48,104 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:47:48,104 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:47:48,107 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:47:48,107 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:47:48,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:47:48,107 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:47:48,108 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:47:48,108 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:47:48,108 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:47:48,108 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:47:48,108 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:47:48,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:47:48,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:47:48,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:47:48,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:47:48,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:47:48,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:47:48,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 11:47:48,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 11:47:48,110 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:47:48,110 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:47:48,111 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:47:48,111 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:47:48,111 INFO L153 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 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 -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2024-10-13 11:47:48,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:47:48,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:47:48,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:47:48,379 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:47:48,379 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:47:48,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i [2024-10-13 11:47:49,700 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:47:49,944 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:47:49,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i [2024-10-13 11:47:49,969 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a97c8d206/434d2a182989412fa86e11cb7ccec717/FLAG89b3137c2 [2024-10-13 11:47:49,987 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a97c8d206/434d2a182989412fa86e11cb7ccec717 [2024-10-13 11:47:49,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:47:49,992 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:47:49,993 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:47:49,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:47:49,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:47:49,999 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:47:49" (1/1) ... [2024-10-13 11:47:50,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3134c875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:49, skipping insertion in model container [2024-10-13 11:47:50,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:47:49" (1/1) ... [2024-10-13 11:47:50,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:47:50,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:47:50,513 ERROR L321 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) [2024-10-13 11:47:50,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@52141ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:50, skipping insertion in model container [2024-10-13 11:47:50,518 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:47:50,519 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 11:47:50,520 INFO L158 Benchmark]: Toolchain (without parser) took 527.50ms. Allocated memory is still 201.3MB. Free memory was 128.4MB in the beginning and 172.1MB in the end (delta: -43.7MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2024-10-13 11:47:50,521 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 159.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 11:47:50,521 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.42ms. Allocated memory is still 201.3MB. Free memory was 128.4MB in the beginning and 172.1MB in the end (delta: -43.7MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2024-10-13 11:47:50,522 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 159.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 525.42ms. Allocated memory is still 201.3MB. Free memory was 128.4MB in the beginning and 172.1MB in the end (delta: -43.7MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 739]: 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: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:47:52,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:47:52,333 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 11:47:52,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:47:52,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:47:52,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:47:52,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:47:52,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:47:52,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:47:52,363 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:47:52,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:47:52,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:47:52,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:47:52,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:47:52,365 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:47:52,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:47:52,365 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:47:52,369 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:47:52,369 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:47:52,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:47:52,370 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:47:52,376 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:47:52,376 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:47:52,376 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:47:52,376 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:47:52,376 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 11:47:52,376 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:47:52,377 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 11:47:52,377 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:47:52,377 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:47:52,377 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:47:52,377 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:47:52,377 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:47:52,377 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:47:52,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:47:52,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:47:52,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:47:52,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:47:52,378 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 11:47:52,378 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 11:47:52,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:47:52,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:47:52,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:47:52,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:47:52,382 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 11:47:52,382 INFO L153 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 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 -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2024-10-13 11:47:52,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:47:52,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:47:52,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:47:52,673 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:47:52,674 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:47:52,676 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i [2024-10-13 11:47:54,104 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:47:54,387 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:47:54,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i [2024-10-13 11:47:54,404 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c8bed058/06e3c4dbaa374bb89f001d14fd8068e0/FLAGc90491c40 [2024-10-13 11:47:54,415 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c8bed058/06e3c4dbaa374bb89f001d14fd8068e0 [2024-10-13 11:47:54,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:47:54,418 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:47:54,419 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:47:54,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:47:54,423 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:47:54,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:47:54" (1/1) ... [2024-10-13 11:47:54,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ad37838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:54, skipping insertion in model container [2024-10-13 11:47:54,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:47:54" (1/1) ... [2024-10-13 11:47:54,475 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:47:54,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:47:54,951 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 11:47:54,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:47:55,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:47:55,058 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 11:47:55,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:47:55,178 INFO L204 MainTranslator]: Completed translation [2024-10-13 11:47:55,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:55 WrapperNode [2024-10-13 11:47:55,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:47:55,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 11:47:55,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 11:47:55,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 11:47:55,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:55" (1/1) ... [2024-10-13 11:47:55,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:55" (1/1) ... [2024-10-13 11:47:55,269 INFO L138 Inliner]: procedures = 180, calls = 274, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1050 [2024-10-13 11:47:55,269 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 11:47:55,270 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 11:47:55,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 11:47:55,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 11:47:55,281 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:55" (1/1) ... [2024-10-13 11:47:55,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:55" (1/1) ... [2024-10-13 11:47:55,293 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:55" (1/1) ... [2024-10-13 11:47:55,372 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 34, 218]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-10-13 11:47:55,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:55" (1/1) ... [2024-10-13 11:47:55,372 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:55" (1/1) ... [2024-10-13 11:47:55,404 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:55" (1/1) ... [2024-10-13 11:47:55,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:55" (1/1) ... [2024-10-13 11:47:55,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:55" (1/1) ... [2024-10-13 11:47:55,421 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:55" (1/1) ... [2024-10-13 11:47:55,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 11:47:55,429 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 11:47:55,429 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 11:47:55,429 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 11:47:55,430 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:55" (1/1) ... [2024-10-13 11:47:55,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:47:55,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:47:55,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 11:47:55,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 11:47:55,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 11:47:55,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 11:47:55,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 11:47:55,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 11:47:55,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 11:47:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 11:47:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 11:47:55,523 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 11:47:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 11:47:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 11:47:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 11:47:55,524 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 11:47:55,524 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 11:47:55,524 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 11:47:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 11:47:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 11:47:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 11:47:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 11:47:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 11:47:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 11:47:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 11:47:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 11:47:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 11:47:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 11:47:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 11:47:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 11:47:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 11:47:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 11:47:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 11:47:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 11:47:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 11:47:55,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 11:47:55,693 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 11:47:55,695 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 11:47:55,698 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:47:55,747 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:47:55,763 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:47:58,733 INFO L? ?]: Removed 1080 outVars from TransFormulas that were not future-live. [2024-10-13 11:47:58,733 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 11:47:58,855 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 11:47:58,855 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-13 11:47:58,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:47:58 BoogieIcfgContainer [2024-10-13 11:47:58,855 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 11:47:58,860 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 11:47:58,860 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 11:47:58,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 11:47:58,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:47:54" (1/3) ... [2024-10-13 11:47:58,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b96b0e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:47:58, skipping insertion in model container [2024-10-13 11:47:58,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:55" (2/3) ... [2024-10-13 11:47:58,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b96b0e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:47:58, skipping insertion in model container [2024-10-13 11:47:58,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:47:58" (3/3) ... [2024-10-13 11:47:58,866 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test3-1.i [2024-10-13 11:47:58,880 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 11:47:58,881 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 525 error locations. [2024-10-13 11:47:58,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 11:47:58,944 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@123bdb6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 11:47:58,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 525 error locations. [2024-10-13 11:47:58,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 958 states, 428 states have (on average 2.5116822429906542) internal successors, (1075), 951 states have internal predecessors, (1075), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 11:47:58,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 11:47:58,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:47:58,954 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 11:47:58,955 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr523ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:47:58,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:47:58,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1666147, now seen corresponding path program 1 times [2024-10-13 11:47:58,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:47:58,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987034296] [2024-10-13 11:47:58,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:47:58,969 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 [2024-10-13 11:47:58,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:47:58,970 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) [2024-10-13 11:47:58,988 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 [2024-10-13 11:47:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:47:59,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:47:59,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:47:59,188 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_56| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_56|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_56| (_ bv0 1)) |c_#valid|))) is different from true [2024-10-13 11:47:59,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:47:59,189 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:47:59,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:47:59,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987034296] [2024-10-13 11:47:59,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [987034296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:47:59,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:47:59,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:47:59,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939015479] [2024-10-13 11:47:59,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:47:59,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:47:59,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:47:59,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:47:59,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-13 11:47:59,249 INFO L87 Difference]: Start difference. First operand has 958 states, 428 states have (on average 2.5116822429906542) internal successors, (1075), 951 states have internal predecessors, (1075), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-10-13 11:48:01,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:01,221 INFO L93 Difference]: Finished difference Result 1309 states and 1412 transitions. [2024-10-13 11:48:01,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:48:01,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-10-13 11:48:01,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:01,243 INFO L225 Difference]: With dead ends: 1309 [2024-10-13 11:48:01,243 INFO L226 Difference]: Without dead ends: 1307 [2024-10-13 11:48:01,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-13 11:48:01,247 INFO L432 NwaCegarLoop]: 749 mSDtfsCounter, 387 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 2224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1413 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:01,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1218 Invalid, 2224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 811 Invalid, 0 Unknown, 1413 Unchecked, 1.8s Time] [2024-10-13 11:48:01,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2024-10-13 11:48:01,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 947. [2024-10-13 11:48:01,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 423 states have (on average 2.3498817966903074) internal successors, (994), 940 states have internal predecessors, (994), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 11:48:01,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1004 transitions. [2024-10-13 11:48:01,316 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1004 transitions. Word has length 3 [2024-10-13 11:48:01,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:01,317 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 1004 transitions. [2024-10-13 11:48:01,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-10-13 11:48:01,317 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1004 transitions. [2024-10-13 11:48:01,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 11:48:01,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:01,317 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 11:48:01,322 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 [2024-10-13 11:48:01,518 WARN L453 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 [2024-10-13 11:48:01,519 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:01,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:01,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1664581, now seen corresponding path program 1 times [2024-10-13 11:48:01,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:01,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015379919] [2024-10-13 11:48:01,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:01,521 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 [2024-10-13 11:48:01,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:01,523 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) [2024-10-13 11:48:01,525 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 [2024-10-13 11:48:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:01,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:48:01,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:01,621 INFO L378 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 [2024-10-13 11:48:01,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:01,628 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:01,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:01,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015379919] [2024-10-13 11:48:01,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015379919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:01,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:01,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 11:48:01,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267149249] [2024-10-13 11:48:01,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:01,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:48:01,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:01,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:48:01,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:48:01,631 INFO L87 Difference]: Start difference. First operand 947 states and 1004 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2024-10-13 11:48:02,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:02,819 INFO L93 Difference]: Finished difference Result 954 states and 1013 transitions. [2024-10-13 11:48:02,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:48:02,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2024-10-13 11:48:02,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:02,822 INFO L225 Difference]: With dead ends: 954 [2024-10-13 11:48:02,823 INFO L226 Difference]: Without dead ends: 954 [2024-10-13 11:48:02,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:48:02,824 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 874 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:02,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 573 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 11:48:02,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-13 11:48:02,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 946. [2024-10-13 11:48:02,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 432 states have (on average 2.303240740740741) internal successors, (995), 938 states have internal predecessors, (995), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 11:48:02,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1005 transitions. [2024-10-13 11:48:02,840 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1005 transitions. Word has length 3 [2024-10-13 11:48:02,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:02,840 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1005 transitions. [2024-10-13 11:48:02,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2024-10-13 11:48:02,840 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1005 transitions. [2024-10-13 11:48:02,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 11:48:02,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:02,841 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 11:48:02,845 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 [2024-10-13 11:48:03,041 WARN L453 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 [2024-10-13 11:48:03,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:03,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:03,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1664582, now seen corresponding path program 1 times [2024-10-13 11:48:03,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:03,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533067402] [2024-10-13 11:48:03,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:03,043 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 [2024-10-13 11:48:03,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:03,046 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) [2024-10-13 11:48:03,046 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 [2024-10-13 11:48:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:03,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:48:03,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:03,143 INFO L378 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 [2024-10-13 11:48:03,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:03,162 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:03,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:03,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533067402] [2024-10-13 11:48:03,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [533067402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:03,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:03,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 11:48:03,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097711549] [2024-10-13 11:48:03,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:03,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:48:03,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:03,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:48:03,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:48:03,164 INFO L87 Difference]: Start difference. First operand 946 states and 1005 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2024-10-13 11:48:05,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:05,095 INFO L93 Difference]: Finished difference Result 1315 states and 1408 transitions. [2024-10-13 11:48:05,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:48:05,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2024-10-13 11:48:05,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:05,100 INFO L225 Difference]: With dead ends: 1315 [2024-10-13 11:48:05,100 INFO L226 Difference]: Without dead ends: 1315 [2024-10-13 11:48:05,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:48:05,102 INFO L432 NwaCegarLoop]: 739 mSDtfsCounter, 397 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:05,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1217 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 11:48:05,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2024-10-13 11:48:05,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1121. [2024-10-13 11:48:05,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 607 states have (on average 2.2784184514003294) internal successors, (1383), 1112 states have internal predecessors, (1383), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 11:48:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1395 transitions. [2024-10-13 11:48:05,120 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1395 transitions. Word has length 3 [2024-10-13 11:48:05,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:05,120 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1395 transitions. [2024-10-13 11:48:05,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2024-10-13 11:48:05,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1395 transitions. [2024-10-13 11:48:05,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 11:48:05,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:05,121 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:05,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 11:48:05,321 WARN L453 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 [2024-10-13 11:48:05,322 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:05,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:05,323 INFO L85 PathProgramCache]: Analyzing trace with hash -322436529, now seen corresponding path program 1 times [2024-10-13 11:48:05,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:05,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464609192] [2024-10-13 11:48:05,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:05,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:05,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:05,327 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) [2024-10-13 11:48:05,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 (5)] Waiting until timeout for monitored process [2024-10-13 11:48:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:05,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 11:48:05,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:05,440 INFO L378 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 [2024-10-13 11:48:05,449 INFO L378 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 [2024-10-13 11:48:05,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:48:05,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 11:48:05,537 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 11:48:05,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 11:48:05,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:05,561 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:05,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:05,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1464609192] [2024-10-13 11:48:05,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1464609192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:05,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:05,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:48:05,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972523207] [2024-10-13 11:48:05,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:05,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:05,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:05,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:05,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:05,563 INFO L87 Difference]: Start difference. First operand 1121 states and 1395 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2024-10-13 11:48:07,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:07,209 INFO L93 Difference]: Finished difference Result 1123 states and 1398 transitions. [2024-10-13 11:48:07,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:48:07,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-10-13 11:48:07,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:07,213 INFO L225 Difference]: With dead ends: 1123 [2024-10-13 11:48:07,213 INFO L226 Difference]: Without dead ends: 1123 [2024-10-13 11:48:07,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:07,216 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 964 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:07,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 300 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 11:48:07,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2024-10-13 11:48:07,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 934. [2024-10-13 11:48:07,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 432 states have (on average 2.2708333333333335) internal successors, (981), 926 states have internal predecessors, (981), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 11:48:07,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 991 transitions. [2024-10-13 11:48:07,258 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 991 transitions. Word has length 7 [2024-10-13 11:48:07,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:07,258 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 991 transitions. [2024-10-13 11:48:07,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2024-10-13 11:48:07,258 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 991 transitions. [2024-10-13 11:48:07,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 11:48:07,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:07,259 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:07,263 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 [2024-10-13 11:48:07,459 WARN L453 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 [2024-10-13 11:48:07,460 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:07,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:07,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1405597810, now seen corresponding path program 1 times [2024-10-13 11:48:07,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:07,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547356490] [2024-10-13 11:48:07,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:07,461 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 [2024-10-13 11:48:07,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:07,465 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) [2024-10-13 11:48:07,467 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 [2024-10-13 11:48:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:07,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:48:07,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:07,555 INFO L378 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 [2024-10-13 11:48:07,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:07,565 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:07,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:07,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547356490] [2024-10-13 11:48:07,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547356490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:07,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:07,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:48:07,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060473023] [2024-10-13 11:48:07,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:07,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:48:07,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:07,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:48:07,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:48:07,567 INFO L87 Difference]: Start difference. First operand 934 states and 991 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-10-13 11:48:09,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:09,086 INFO L93 Difference]: Finished difference Result 1236 states and 1324 transitions. [2024-10-13 11:48:09,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:48:09,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-10-13 11:48:09,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:09,090 INFO L225 Difference]: With dead ends: 1236 [2024-10-13 11:48:09,091 INFO L226 Difference]: Without dead ends: 1236 [2024-10-13 11:48:09,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:48:09,091 INFO L432 NwaCegarLoop]: 780 mSDtfsCounter, 833 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:09,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 990 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 11:48:09,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2024-10-13 11:48:09,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 886. [2024-10-13 11:48:09,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 432 states have (on average 2.1597222222222223) internal successors, (933), 878 states have internal predecessors, (933), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 11:48:09,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 943 transitions. [2024-10-13 11:48:09,104 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 943 transitions. Word has length 8 [2024-10-13 11:48:09,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:09,104 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 943 transitions. [2024-10-13 11:48:09,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-10-13 11:48:09,104 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 943 transitions. [2024-10-13 11:48:09,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 11:48:09,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:09,105 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:09,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-13 11:48:09,308 WARN L453 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 [2024-10-13 11:48:09,308 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:09,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:09,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1405597809, now seen corresponding path program 1 times [2024-10-13 11:48:09,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:09,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942402832] [2024-10-13 11:48:09,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:09,310 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 [2024-10-13 11:48:09,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:09,311 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) [2024-10-13 11:48:09,312 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 [2024-10-13 11:48:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:09,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:48:09,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:09,434 INFO L378 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 [2024-10-13 11:48:09,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:09,460 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:09,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:09,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942402832] [2024-10-13 11:48:09,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942402832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:09,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:09,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:48:09,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440736479] [2024-10-13 11:48:09,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:09,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:48:09,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:09,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:48:09,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:48:09,463 INFO L87 Difference]: Start difference. First operand 886 states and 943 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-10-13 11:48:11,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:11,347 INFO L93 Difference]: Finished difference Result 1310 states and 1401 transitions. [2024-10-13 11:48:11,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:48:11,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-10-13 11:48:11,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:11,351 INFO L225 Difference]: With dead ends: 1310 [2024-10-13 11:48:11,351 INFO L226 Difference]: Without dead ends: 1310 [2024-10-13 11:48:11,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:48:11,353 INFO L432 NwaCegarLoop]: 942 mSDtfsCounter, 623 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:11,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 1290 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 11:48:11,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2024-10-13 11:48:11,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 903. [2024-10-13 11:48:11,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 459 states have (on average 2.150326797385621) internal successors, (987), 895 states have internal predecessors, (987), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 11:48:11,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 997 transitions. [2024-10-13 11:48:11,368 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 997 transitions. Word has length 8 [2024-10-13 11:48:11,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:11,368 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 997 transitions. [2024-10-13 11:48:11,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-10-13 11:48:11,368 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 997 transitions. [2024-10-13 11:48:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 11:48:11,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:11,369 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:11,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-13 11:48:11,569 WARN L453 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 [2024-10-13 11:48:11,570 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:11,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:11,571 INFO L85 PathProgramCache]: Analyzing trace with hash 555831039, now seen corresponding path program 1 times [2024-10-13 11:48:11,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:11,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605206999] [2024-10-13 11:48:11,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:11,571 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 [2024-10-13 11:48:11,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:11,574 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) [2024-10-13 11:48:11,576 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 [2024-10-13 11:48:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:11,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 11:48:11,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:11,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:11,739 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:11,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:11,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [605206999] [2024-10-13 11:48:11,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [605206999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:11,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:11,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:48:11,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031529410] [2024-10-13 11:48:11,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:11,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:11,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:11,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:11,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:11,741 INFO L87 Difference]: Start difference. First operand 903 states and 997 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2024-10-13 11:48:12,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:12,891 INFO L93 Difference]: Finished difference Result 1283 states and 1433 transitions. [2024-10-13 11:48:12,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:48:12,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-10-13 11:48:12,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:12,896 INFO L225 Difference]: With dead ends: 1283 [2024-10-13 11:48:12,897 INFO L226 Difference]: Without dead ends: 1283 [2024-10-13 11:48:12,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:12,897 INFO L432 NwaCegarLoop]: 872 mSDtfsCounter, 403 mSDsluCounter, 1527 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 2399 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:12,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 2399 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 11:48:12,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2024-10-13 11:48:12,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1105. [2024-10-13 11:48:12,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 660 states have (on average 2.125757575757576) internal successors, (1403), 1096 states have internal predecessors, (1403), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 11:48:12,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1415 transitions. [2024-10-13 11:48:12,915 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1415 transitions. Word has length 11 [2024-10-13 11:48:12,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:12,915 INFO L471 AbstractCegarLoop]: Abstraction has 1105 states and 1415 transitions. [2024-10-13 11:48:12,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2024-10-13 11:48:12,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1415 transitions. [2024-10-13 11:48:12,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 11:48:12,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:12,916 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:12,920 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 [2024-10-13 11:48:13,116 WARN L453 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 [2024-10-13 11:48:13,117 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr523ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:13,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:13,117 INFO L85 PathProgramCache]: Analyzing trace with hash 50893139, now seen corresponding path program 1 times [2024-10-13 11:48:13,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:13,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861455395] [2024-10-13 11:48:13,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:13,118 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 [2024-10-13 11:48:13,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:13,120 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) [2024-10-13 11:48:13,121 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 [2024-10-13 11:48:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:13,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:48:13,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:13,307 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_57| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_57|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_57| (_ bv0 1)) |c_#valid|))) is different from true [2024-10-13 11:48:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:13,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:13,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:13,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [861455395] [2024-10-13 11:48:13,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [861455395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:13,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:13,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:48:13,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660594291] [2024-10-13 11:48:13,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:13,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:13,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:13,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:13,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-13 11:48:13,309 INFO L87 Difference]: Start difference. First operand 1105 states and 1415 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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) [2024-10-13 11:48:14,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:14,625 INFO L93 Difference]: Finished difference Result 1425 states and 1818 transitions. [2024-10-13 11:48:14,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:48:14,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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 [2024-10-13 11:48:14,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:14,633 INFO L225 Difference]: With dead ends: 1425 [2024-10-13 11:48:14,633 INFO L226 Difference]: Without dead ends: 1421 [2024-10-13 11:48:14,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-13 11:48:14,634 INFO L432 NwaCegarLoop]: 713 mSDtfsCounter, 294 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1230 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:14,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1173 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 681 Invalid, 0 Unknown, 1230 Unchecked, 1.3s Time] [2024-10-13 11:48:14,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2024-10-13 11:48:14,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1174. [2024-10-13 11:48:14,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 728 states have (on average 2.1016483516483517) internal successors, (1530), 1164 states have internal predecessors, (1530), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 11:48:14,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1544 transitions. [2024-10-13 11:48:14,649 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1544 transitions. Word has length 12 [2024-10-13 11:48:14,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:14,649 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 1544 transitions. [2024-10-13 11:48:14,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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) [2024-10-13 11:48:14,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1544 transitions. [2024-10-13 11:48:14,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 11:48:14,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:14,650 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:14,655 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 [2024-10-13 11:48:14,851 WARN L453 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 [2024-10-13 11:48:14,856 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:14,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:14,857 INFO L85 PathProgramCache]: Analyzing trace with hash 985945624, now seen corresponding path program 1 times [2024-10-13 11:48:14,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:14,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703773775] [2024-10-13 11:48:14,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:14,858 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 [2024-10-13 11:48:14,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:14,862 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) [2024-10-13 11:48:14,864 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 [2024-10-13 11:48:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:14,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 11:48:14,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:14,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:14,975 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:14,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:14,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1703773775] [2024-10-13 11:48:14,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1703773775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:14,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:14,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:48:14,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093002533] [2024-10-13 11:48:14,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:14,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:48:14,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:14,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:48:14,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:48:14,976 INFO L87 Difference]: Start difference. First operand 1174 states and 1544 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2024-10-13 11:48:15,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:15,422 INFO L93 Difference]: Finished difference Result 1105 states and 1424 transitions. [2024-10-13 11:48:15,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:48:15,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2024-10-13 11:48:15,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:15,425 INFO L225 Difference]: With dead ends: 1105 [2024-10-13 11:48:15,426 INFO L226 Difference]: Without dead ends: 1105 [2024-10-13 11:48:15,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:48:15,426 INFO L432 NwaCegarLoop]: 775 mSDtfsCounter, 61 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:15,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1508 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 11:48:15,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2024-10-13 11:48:15,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1105. [2024-10-13 11:48:15,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 683 states have (on average 2.0644216691068813) internal successors, (1410), 1095 states have internal predecessors, (1410), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 11:48:15,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1424 transitions. [2024-10-13 11:48:15,440 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1424 transitions. Word has length 13 [2024-10-13 11:48:15,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:15,440 INFO L471 AbstractCegarLoop]: Abstraction has 1105 states and 1424 transitions. [2024-10-13 11:48:15,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2024-10-13 11:48:15,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1424 transitions. [2024-10-13 11:48:15,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 11:48:15,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:15,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:15,445 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 [2024-10-13 11:48:15,641 WARN L453 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 [2024-10-13 11:48:15,641 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr354REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:15,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:15,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1694002318, now seen corresponding path program 1 times [2024-10-13 11:48:15,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:15,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004353122] [2024-10-13 11:48:15,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:15,642 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 [2024-10-13 11:48:15,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:15,645 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) [2024-10-13 11:48:15,646 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 [2024-10-13 11:48:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:15,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:48:15,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:15,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:15,765 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:15,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:15,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004353122] [2024-10-13 11:48:15,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004353122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:15,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:15,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:48:15,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45370267] [2024-10-13 11:48:15,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:15,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:15,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:15,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:15,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:15,767 INFO L87 Difference]: Start difference. First operand 1105 states and 1424 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) [2024-10-13 11:48:16,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:16,336 INFO L93 Difference]: Finished difference Result 1088 states and 1358 transitions. [2024-10-13 11:48:16,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:48:16,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2024-10-13 11:48:16,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:16,340 INFO L225 Difference]: With dead ends: 1088 [2024-10-13 11:48:16,340 INFO L226 Difference]: Without dead ends: 1088 [2024-10-13 11:48:16,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:48:16,341 INFO L432 NwaCegarLoop]: 744 mSDtfsCounter, 45 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2214 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:16,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2214 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 11:48:16,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2024-10-13 11:48:16,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1088. [2024-10-13 11:48:16,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 680 states have (on average 1.9764705882352942) internal successors, (1344), 1078 states have internal predecessors, (1344), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 11:48:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1358 transitions. [2024-10-13 11:48:16,353 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1358 transitions. Word has length 15 [2024-10-13 11:48:16,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:16,353 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1358 transitions. [2024-10-13 11:48:16,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) [2024-10-13 11:48:16,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1358 transitions. [2024-10-13 11:48:16,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 11:48:16,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:16,353 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:16,357 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 (11)] Ended with exit code 0 [2024-10-13 11:48:16,554 WARN L453 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 [2024-10-13 11:48:16,554 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:16,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:16,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1265994533, now seen corresponding path program 1 times [2024-10-13 11:48:16,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:16,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203687022] [2024-10-13 11:48:16,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:16,555 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 [2024-10-13 11:48:16,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:16,556 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) [2024-10-13 11:48:16,557 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 [2024-10-13 11:48:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:16,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 11:48:16,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:16,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:16,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:16,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:16,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203687022] [2024-10-13 11:48:16,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203687022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:16,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:16,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:48:16,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2866997] [2024-10-13 11:48:16,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:16,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:48:16,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:16,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:48:16,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:48:16,697 INFO L87 Difference]: Start difference. First operand 1088 states and 1358 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2024-10-13 11:48:17,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:17,126 INFO L93 Difference]: Finished difference Result 1034 states and 1278 transitions. [2024-10-13 11:48:17,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:48:17,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 [2024-10-13 11:48:17,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:17,129 INFO L225 Difference]: With dead ends: 1034 [2024-10-13 11:48:17,129 INFO L226 Difference]: Without dead ends: 1034 [2024-10-13 11:48:17,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:48:17,130 INFO L432 NwaCegarLoop]: 717 mSDtfsCounter, 61 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:17,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1392 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 11:48:17,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-13 11:48:17,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-13 11:48:17,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 650 states have (on average 1.9446153846153846) internal successors, (1264), 1024 states have internal predecessors, (1264), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 11:48:17,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1278 transitions. [2024-10-13 11:48:17,141 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1278 transitions. Word has length 16 [2024-10-13 11:48:17,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:17,141 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1278 transitions. [2024-10-13 11:48:17,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2024-10-13 11:48:17,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1278 transitions. [2024-10-13 11:48:17,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 11:48:17,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:17,144 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:17,149 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 [2024-10-13 11:48:17,344 WARN L453 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 [2024-10-13 11:48:17,345 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:17,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:17,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1144998559, now seen corresponding path program 1 times [2024-10-13 11:48:17,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:17,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788495206] [2024-10-13 11:48:17,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:17,346 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 [2024-10-13 11:48:17,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:17,349 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) [2024-10-13 11:48:17,350 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 [2024-10-13 11:48:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:17,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:48:17,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:17,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:17,494 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:17,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:17,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788495206] [2024-10-13 11:48:17,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788495206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:17,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:17,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:48:17,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877012510] [2024-10-13 11:48:17,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:17,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:17,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:17,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:17,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:17,496 INFO L87 Difference]: Start difference. First operand 1034 states and 1278 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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) [2024-10-13 11:48:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:18,044 INFO L93 Difference]: Finished difference Result 1018 states and 1234 transitions. [2024-10-13 11:48:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:48:18,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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 [2024-10-13 11:48:18,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:18,048 INFO L225 Difference]: With dead ends: 1018 [2024-10-13 11:48:18,048 INFO L226 Difference]: Without dead ends: 1018 [2024-10-13 11:48:18,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:48:18,049 INFO L432 NwaCegarLoop]: 686 mSDtfsCounter, 45 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:18,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2040 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 11:48:18,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2024-10-13 11:48:18,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1018. [2024-10-13 11:48:18,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 648 states have (on average 1.882716049382716) internal successors, (1220), 1008 states have internal predecessors, (1220), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 11:48:18,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1234 transitions. [2024-10-13 11:48:18,063 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1234 transitions. Word has length 18 [2024-10-13 11:48:18,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:18,063 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1234 transitions. [2024-10-13 11:48:18,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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) [2024-10-13 11:48:18,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1234 transitions. [2024-10-13 11:48:18,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 11:48:18,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:18,065 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:18,072 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 (13)] Ended with exit code 0 [2024-10-13 11:48:18,265 WARN L453 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 [2024-10-13 11:48:18,266 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr368REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:18,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:18,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1385816352, now seen corresponding path program 1 times [2024-10-13 11:48:18,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:18,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597769184] [2024-10-13 11:48:18,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:18,266 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 [2024-10-13 11:48:18,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:18,268 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) [2024-10-13 11:48:18,268 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 [2024-10-13 11:48:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:18,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:48:18,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:18,370 INFO L378 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 [2024-10-13 11:48:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:18,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:18,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:18,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597769184] [2024-10-13 11:48:18,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597769184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:18,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:18,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:48:18,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749880901] [2024-10-13 11:48:18,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:18,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:18,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:18,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:18,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:18,433 INFO L87 Difference]: Start difference. First operand 1018 states and 1234 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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) [2024-10-13 11:48:19,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:19,537 INFO L93 Difference]: Finished difference Result 1034 states and 1242 transitions. [2024-10-13 11:48:19,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:48:19,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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 29 [2024-10-13 11:48:19,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:19,541 INFO L225 Difference]: With dead ends: 1034 [2024-10-13 11:48:19,541 INFO L226 Difference]: Without dead ends: 1034 [2024-10-13 11:48:19,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:48:19,544 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 697 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:19,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 855 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 11:48:19,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-13 11:48:19,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1014. [2024-10-13 11:48:19,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 648 states have (on average 1.8641975308641976) internal successors, (1208), 1004 states have internal predecessors, (1208), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 11:48:19,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1222 transitions. [2024-10-13 11:48:19,557 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1222 transitions. Word has length 29 [2024-10-13 11:48:19,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:19,558 INFO L471 AbstractCegarLoop]: Abstraction has 1014 states and 1222 transitions. [2024-10-13 11:48:19,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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) [2024-10-13 11:48:19,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1222 transitions. [2024-10-13 11:48:19,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 11:48:19,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:19,559 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:19,564 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 (14)] Ended with exit code 0 [2024-10-13 11:48:19,760 WARN L453 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 [2024-10-13 11:48:19,760 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr369REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:19,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:19,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1385816351, now seen corresponding path program 1 times [2024-10-13 11:48:19,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:19,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552307028] [2024-10-13 11:48:19,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:19,762 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 [2024-10-13 11:48:19,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:19,765 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) [2024-10-13 11:48:19,766 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 [2024-10-13 11:48:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:19,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:48:19,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:19,884 INFO L378 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 [2024-10-13 11:48:20,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:20,047 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:20,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:20,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [552307028] [2024-10-13 11:48:20,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [552307028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:20,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:20,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:48:20,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267235402] [2024-10-13 11:48:20,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:20,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:20,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:20,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:20,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:20,048 INFO L87 Difference]: Start difference. First operand 1014 states and 1222 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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) [2024-10-13 11:48:21,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:21,949 INFO L93 Difference]: Finished difference Result 1445 states and 1777 transitions. [2024-10-13 11:48:21,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:48:21,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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 29 [2024-10-13 11:48:21,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:21,953 INFO L225 Difference]: With dead ends: 1445 [2024-10-13 11:48:21,953 INFO L226 Difference]: Without dead ends: 1445 [2024-10-13 11:48:21,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:48:21,953 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 332 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:21,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 1313 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 11:48:21,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2024-10-13 11:48:21,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1284. [2024-10-13 11:48:21,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 916 states have (on average 1.8919213973799127) internal successors, (1733), 1272 states have internal predecessors, (1733), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 11:48:21,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1751 transitions. [2024-10-13 11:48:21,970 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1751 transitions. Word has length 29 [2024-10-13 11:48:21,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:21,970 INFO L471 AbstractCegarLoop]: Abstraction has 1284 states and 1751 transitions. [2024-10-13 11:48:21,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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) [2024-10-13 11:48:21,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1751 transitions. [2024-10-13 11:48:21,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 11:48:21,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:21,973 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:21,982 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 (15)] Ended with exit code 0 [2024-10-13 11:48:22,173 WARN L453 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 [2024-10-13 11:48:22,174 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:22,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:22,174 INFO L85 PathProgramCache]: Analyzing trace with hash 874153197, now seen corresponding path program 1 times [2024-10-13 11:48:22,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:22,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67088472] [2024-10-13 11:48:22,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:22,175 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 [2024-10-13 11:48:22,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:22,176 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) [2024-10-13 11:48:22,179 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 [2024-10-13 11:48:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:22,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:48:22,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:22,326 INFO L378 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 [2024-10-13 11:48:22,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:22,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:22,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:22,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67088472] [2024-10-13 11:48:22,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67088472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:22,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:22,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:48:22,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818838828] [2024-10-13 11:48:22,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:22,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:22,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:22,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:22,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:22,389 INFO L87 Difference]: Start difference. First operand 1284 states and 1751 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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) [2024-10-13 11:48:23,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:23,997 INFO L93 Difference]: Finished difference Result 1690 states and 2281 transitions. [2024-10-13 11:48:24,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:48:24,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2024-10-13 11:48:24,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:24,006 INFO L225 Difference]: With dead ends: 1690 [2024-10-13 11:48:24,006 INFO L226 Difference]: Without dead ends: 1690 [2024-10-13 11:48:24,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:48:24,007 INFO L432 NwaCegarLoop]: 651 mSDtfsCounter, 703 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:24,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 1316 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 11:48:24,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2024-10-13 11:48:24,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1280. [2024-10-13 11:48:24,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 916 states have (on average 1.8831877729257642) internal successors, (1725), 1268 states have internal predecessors, (1725), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 11:48:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1743 transitions. [2024-10-13 11:48:24,030 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1743 transitions. Word has length 32 [2024-10-13 11:48:24,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:24,030 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1743 transitions. [2024-10-13 11:48:24,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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) [2024-10-13 11:48:24,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1743 transitions. [2024-10-13 11:48:24,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 11:48:24,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:24,031 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:24,041 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 [2024-10-13 11:48:24,232 WARN L453 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 [2024-10-13 11:48:24,232 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:24,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:24,233 INFO L85 PathProgramCache]: Analyzing trace with hash 874153198, now seen corresponding path program 1 times [2024-10-13 11:48:24,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:24,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311877987] [2024-10-13 11:48:24,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:24,233 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 [2024-10-13 11:48:24,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:24,236 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) [2024-10-13 11:48:24,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-13 11:48:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:24,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:48:24,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:24,420 INFO L378 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 [2024-10-13 11:48:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:24,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:24,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:24,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311877987] [2024-10-13 11:48:24,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311877987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:24,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:24,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:48:24,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037711768] [2024-10-13 11:48:24,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:24,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:24,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:24,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:24,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:24,564 INFO L87 Difference]: Start difference. First operand 1280 states and 1743 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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) [2024-10-13 11:48:27,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:27,139 INFO L93 Difference]: Finished difference Result 1747 states and 2302 transitions. [2024-10-13 11:48:27,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:48:27,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2024-10-13 11:48:27,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:27,145 INFO L225 Difference]: With dead ends: 1747 [2024-10-13 11:48:27,145 INFO L226 Difference]: Without dead ends: 1747 [2024-10-13 11:48:27,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:48:27,146 INFO L432 NwaCegarLoop]: 876 mSDtfsCounter, 489 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:27,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 1738 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 11:48:27,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2024-10-13 11:48:27,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1276. [2024-10-13 11:48:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 916 states have (on average 1.8744541484716157) internal successors, (1717), 1264 states have internal predecessors, (1717), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 11:48:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1735 transitions. [2024-10-13 11:48:27,165 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1735 transitions. Word has length 32 [2024-10-13 11:48:27,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:27,165 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1735 transitions. [2024-10-13 11:48:27,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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) [2024-10-13 11:48:27,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1735 transitions. [2024-10-13 11:48:27,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-13 11:48:27,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:27,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:27,173 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 [2024-10-13 11:48:27,367 WARN L453 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 [2024-10-13 11:48:27,367 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr414REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:27,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:27,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1598252439, now seen corresponding path program 1 times [2024-10-13 11:48:27,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:27,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438044910] [2024-10-13 11:48:27,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:27,368 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 [2024-10-13 11:48:27,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:27,369 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) [2024-10-13 11:48:27,370 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 [2024-10-13 11:48:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:27,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:48:27,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:27,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:27,521 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:27,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:27,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438044910] [2024-10-13 11:48:27,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438044910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:27,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:27,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:48:27,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304892859] [2024-10-13 11:48:27,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:27,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:27,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:27,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:27,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:27,523 INFO L87 Difference]: Start difference. First operand 1276 states and 1735 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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) [2024-10-13 11:48:28,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:28,218 INFO L93 Difference]: Finished difference Result 1246 states and 1685 transitions. [2024-10-13 11:48:28,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:48:28,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 48 [2024-10-13 11:48:28,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:28,223 INFO L225 Difference]: With dead ends: 1246 [2024-10-13 11:48:28,223 INFO L226 Difference]: Without dead ends: 1246 [2024-10-13 11:48:28,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:48:28,224 INFO L432 NwaCegarLoop]: 676 mSDtfsCounter, 21 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2005 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:28,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2005 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 11:48:28,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2024-10-13 11:48:28,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1246. [2024-10-13 11:48:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 886 states have (on average 1.881489841986456) internal successors, (1667), 1234 states have internal predecessors, (1667), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 11:48:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 1685 transitions. [2024-10-13 11:48:28,237 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 1685 transitions. Word has length 48 [2024-10-13 11:48:28,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:28,237 INFO L471 AbstractCegarLoop]: Abstraction has 1246 states and 1685 transitions. [2024-10-13 11:48:28,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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) [2024-10-13 11:48:28,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 1685 transitions. [2024-10-13 11:48:28,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-13 11:48:28,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:28,239 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:28,244 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 [2024-10-13 11:48:28,440 WARN L453 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 [2024-10-13 11:48:28,441 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:28,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:28,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1192229815, now seen corresponding path program 1 times [2024-10-13 11:48:28,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:28,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640775279] [2024-10-13 11:48:28,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:28,442 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 [2024-10-13 11:48:28,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:28,447 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) [2024-10-13 11:48:28,448 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 [2024-10-13 11:48:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:28,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:48:28,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:28,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:28,711 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:28,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:28,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [640775279] [2024-10-13 11:48:28,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [640775279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:28,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:28,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:48:28,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258697595] [2024-10-13 11:48:28,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:28,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:28,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:28,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:28,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:28,712 INFO L87 Difference]: Start difference. First operand 1246 states and 1685 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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) [2024-10-13 11:48:29,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:29,465 INFO L93 Difference]: Finished difference Result 1234 states and 1665 transitions. [2024-10-13 11:48:29,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:48:29,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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) Word has length 51 [2024-10-13 11:48:29,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:29,471 INFO L225 Difference]: With dead ends: 1234 [2024-10-13 11:48:29,471 INFO L226 Difference]: Without dead ends: 1234 [2024-10-13 11:48:29,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:48:29,472 INFO L432 NwaCegarLoop]: 672 mSDtfsCounter, 15 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1999 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:29,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1999 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 11:48:29,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2024-10-13 11:48:29,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1234. [2024-10-13 11:48:29,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 874 states have (on average 1.8844393592677346) internal successors, (1647), 1222 states have internal predecessors, (1647), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 11:48:29,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1665 transitions. [2024-10-13 11:48:29,489 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 1665 transitions. Word has length 51 [2024-10-13 11:48:29,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:29,489 INFO L471 AbstractCegarLoop]: Abstraction has 1234 states and 1665 transitions. [2024-10-13 11:48:29,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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) [2024-10-13 11:48:29,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1665 transitions. [2024-10-13 11:48:29,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-13 11:48:29,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:29,490 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:29,497 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 (19)] Ended with exit code 0 [2024-10-13 11:48:29,691 WARN L453 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 [2024-10-13 11:48:29,691 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr414REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:29,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:29,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1092574424, now seen corresponding path program 1 times [2024-10-13 11:48:29,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:29,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815866131] [2024-10-13 11:48:29,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:29,692 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 [2024-10-13 11:48:29,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:29,693 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) [2024-10-13 11:48:29,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-13 11:48:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:29,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:48:29,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:29,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:29,880 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:29,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:29,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815866131] [2024-10-13 11:48:29,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815866131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:29,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:29,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:48:29,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334411982] [2024-10-13 11:48:29,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:29,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:48:29,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:29,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:48:29,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:48:29,883 INFO L87 Difference]: Start difference. First operand 1234 states and 1665 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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) [2024-10-13 11:48:30,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:30,333 INFO L93 Difference]: Finished difference Result 1066 states and 1155 transitions. [2024-10-13 11:48:30,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:48:30,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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) Word has length 52 [2024-10-13 11:48:30,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:30,336 INFO L225 Difference]: With dead ends: 1066 [2024-10-13 11:48:30,336 INFO L226 Difference]: Without dead ends: 1066 [2024-10-13 11:48:30,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:48:30,337 INFO L432 NwaCegarLoop]: 738 mSDtfsCounter, 93 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:30,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1366 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 11:48:30,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2024-10-13 11:48:30,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 929. [2024-10-13 11:48:30,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 571 states have (on average 1.746059544658494) internal successors, (997), 919 states have internal predecessors, (997), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 11:48:30,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1011 transitions. [2024-10-13 11:48:30,346 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1011 transitions. Word has length 52 [2024-10-13 11:48:30,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:30,346 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1011 transitions. [2024-10-13 11:48:30,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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) [2024-10-13 11:48:30,346 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1011 transitions. [2024-10-13 11:48:30,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 11:48:30,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:30,347 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:30,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-13 11:48:30,547 WARN L453 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 [2024-10-13 11:48:30,548 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:30,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:30,548 INFO L85 PathProgramCache]: Analyzing trace with hash 929073503, now seen corresponding path program 1 times [2024-10-13 11:48:30,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:30,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468577388] [2024-10-13 11:48:30,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:30,548 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 [2024-10-13 11:48:30,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:30,550 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) [2024-10-13 11:48:30,550 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 [2024-10-13 11:48:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:30,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 11:48:30,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:30,728 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:48:30,728 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:48:30,728 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:48:30,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-13 11:48:30,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:48:30,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-13 11:48:30,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:30,812 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:30,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:30,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468577388] [2024-10-13 11:48:30,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468577388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:30,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:30,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:48:30,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659104764] [2024-10-13 11:48:30,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:30,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 11:48:30,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:30,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 11:48:30,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:48:30,814 INFO L87 Difference]: Start difference. First operand 929 states and 1011 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:32,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:32,082 INFO L93 Difference]: Finished difference Result 1538 states and 1656 transitions. [2024-10-13 11:48:32,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:48:32,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-13 11:48:32,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:32,087 INFO L225 Difference]: With dead ends: 1538 [2024-10-13 11:48:32,087 INFO L226 Difference]: Without dead ends: 1535 [2024-10-13 11:48:32,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:48:32,087 INFO L432 NwaCegarLoop]: 849 mSDtfsCounter, 1431 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1439 SdHoareTripleChecker+Valid, 3195 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:32,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1439 Valid, 3195 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 11:48:32,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2024-10-13 11:48:32,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 881. [2024-10-13 11:48:32,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 524 states have (on average 1.8110687022900764) internal successors, (949), 872 states have internal predecessors, (949), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 11:48:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 961 transitions. [2024-10-13 11:48:32,097 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 961 transitions. Word has length 55 [2024-10-13 11:48:32,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:32,097 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 961 transitions. [2024-10-13 11:48:32,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 961 transitions. [2024-10-13 11:48:32,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 11:48:32,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:32,097 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:32,104 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 [2024-10-13 11:48:32,298 WARN L453 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 [2024-10-13 11:48:32,298 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:32,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:32,298 INFO L85 PathProgramCache]: Analyzing trace with hash 642490614, now seen corresponding path program 1 times [2024-10-13 11:48:32,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:32,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802615949] [2024-10-13 11:48:32,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:32,299 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 [2024-10-13 11:48:32,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:32,301 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) [2024-10-13 11:48:32,302 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 [2024-10-13 11:48:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:32,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 11:48:32,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:32,553 INFO L378 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 [2024-10-13 11:48:32,558 INFO L378 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 [2024-10-13 11:48:32,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:48:32,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 11:48:32,876 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 11:48:32,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 11:48:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:32,890 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:32,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:32,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802615949] [2024-10-13 11:48:32,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802615949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:32,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:32,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:48:32,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121646657] [2024-10-13 11:48:32,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:32,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:32,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:32,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:32,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:32,891 INFO L87 Difference]: Start difference. First operand 881 states and 961 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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) [2024-10-13 11:48:34,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:34,487 INFO L93 Difference]: Finished difference Result 1181 states and 1285 transitions. [2024-10-13 11:48:34,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:48:34,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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 55 [2024-10-13 11:48:34,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:34,491 INFO L225 Difference]: With dead ends: 1181 [2024-10-13 11:48:34,492 INFO L226 Difference]: Without dead ends: 1181 [2024-10-13 11:48:34,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:34,492 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 1562 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1567 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:34,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1567 Valid, 327 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 11:48:34,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2024-10-13 11:48:34,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 816. [2024-10-13 11:48:34,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 497 states have (on average 1.704225352112676) internal successors, (847), 807 states have internal predecessors, (847), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 11:48:34,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 859 transitions. [2024-10-13 11:48:34,501 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 859 transitions. Word has length 55 [2024-10-13 11:48:34,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:34,501 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 859 transitions. [2024-10-13 11:48:34,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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) [2024-10-13 11:48:34,501 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 859 transitions. [2024-10-13 11:48:34,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 11:48:34,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:34,502 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:34,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-10-13 11:48:34,702 WARN L453 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 [2024-10-13 11:48:34,702 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:34,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:34,703 INFO L85 PathProgramCache]: Analyzing trace with hash 847592822, now seen corresponding path program 1 times [2024-10-13 11:48:34,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:34,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1453403619] [2024-10-13 11:48:34,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:34,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:34,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:34,705 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) [2024-10-13 11:48:34,706 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 [2024-10-13 11:48:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:34,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:48:34,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:34,927 INFO L378 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 [2024-10-13 11:48:34,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:48:34,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 11:48:34,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:34,959 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:34,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:34,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1453403619] [2024-10-13 11:48:34,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1453403619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:34,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:34,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:48:34,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67901032] [2024-10-13 11:48:34,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:34,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:48:34,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:34,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:48:34,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:48:34,960 INFO L87 Difference]: Start difference. First operand 816 states and 859 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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) [2024-10-13 11:48:36,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:36,507 INFO L93 Difference]: Finished difference Result 815 states and 858 transitions. [2024-10-13 11:48:36,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:48:36,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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 59 [2024-10-13 11:48:36,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:36,511 INFO L225 Difference]: With dead ends: 815 [2024-10-13 11:48:36,511 INFO L226 Difference]: Without dead ends: 815 [2024-10-13 11:48:36,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:48:36,512 INFO L432 NwaCegarLoop]: 646 mSDtfsCounter, 2 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:36,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1688 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 11:48:36,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2024-10-13 11:48:36,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 815. [2024-10-13 11:48:36,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 497 states have (on average 1.7022132796780685) internal successors, (846), 806 states have internal predecessors, (846), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 11:48:36,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 858 transitions. [2024-10-13 11:48:36,518 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 858 transitions. Word has length 59 [2024-10-13 11:48:36,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:36,519 INFO L471 AbstractCegarLoop]: Abstraction has 815 states and 858 transitions. [2024-10-13 11:48:36,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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) [2024-10-13 11:48:36,519 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 858 transitions. [2024-10-13 11:48:36,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 11:48:36,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:36,519 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:36,526 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 [2024-10-13 11:48:36,719 WARN L453 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 [2024-10-13 11:48:36,720 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:36,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:36,720 INFO L85 PathProgramCache]: Analyzing trace with hash 847592823, now seen corresponding path program 1 times [2024-10-13 11:48:36,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:36,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491418783] [2024-10-13 11:48:36,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:36,720 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 [2024-10-13 11:48:36,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:36,723 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) [2024-10-13 11:48:36,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-10-13 11:48:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:36,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 11:48:36,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:36,951 INFO L378 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 [2024-10-13 11:48:36,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 11:48:36,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:48:37,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-13 11:48:37,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:37,016 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:37,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:37,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491418783] [2024-10-13 11:48:37,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491418783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:37,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:37,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:48:37,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824281973] [2024-10-13 11:48:37,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:37,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:48:37,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:37,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:48:37,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:48:37,017 INFO L87 Difference]: Start difference. First operand 815 states and 858 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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) [2024-10-13 11:48:38,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:38,899 INFO L93 Difference]: Finished difference Result 814 states and 857 transitions. [2024-10-13 11:48:38,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:48:38,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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 59 [2024-10-13 11:48:38,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:38,903 INFO L225 Difference]: With dead ends: 814 [2024-10-13 11:48:38,903 INFO L226 Difference]: Without dead ends: 814 [2024-10-13 11:48:38,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:48:38,904 INFO L432 NwaCegarLoop]: 646 mSDtfsCounter, 1 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:38,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1712 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 11:48:38,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2024-10-13 11:48:38,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 814. [2024-10-13 11:48:38,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 496 states have (on average 1.7036290322580645) internal successors, (845), 805 states have internal predecessors, (845), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 11:48:38,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 857 transitions. [2024-10-13 11:48:38,912 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 857 transitions. Word has length 59 [2024-10-13 11:48:38,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:38,913 INFO L471 AbstractCegarLoop]: Abstraction has 814 states and 857 transitions. [2024-10-13 11:48:38,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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) [2024-10-13 11:48:38,913 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 857 transitions. [2024-10-13 11:48:38,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-13 11:48:38,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:38,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:38,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2024-10-13 11:48:39,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:39,114 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:39,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:39,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1004455622, now seen corresponding path program 1 times [2024-10-13 11:48:39,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:39,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975114658] [2024-10-13 11:48:39,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:39,115 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 [2024-10-13 11:48:39,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:39,125 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:39,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-10-13 11:48:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:39,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:48:39,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:39,361 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:39,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:39,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975114658] [2024-10-13 11:48:39,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975114658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:39,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:39,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:48:39,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416729946] [2024-10-13 11:48:39,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:39,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:39,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:39,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:39,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:39,362 INFO L87 Difference]: Start difference. First operand 814 states and 857 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 11:48:39,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:39,950 INFO L93 Difference]: Finished difference Result 816 states and 860 transitions. [2024-10-13 11:48:39,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:48:39,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2024-10-13 11:48:39,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:39,955 INFO L225 Difference]: With dead ends: 816 [2024-10-13 11:48:39,956 INFO L226 Difference]: Without dead ends: 816 [2024-10-13 11:48:39,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:39,957 INFO L432 NwaCegarLoop]: 646 mSDtfsCounter, 0 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:39,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1935 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 11:48:39,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2024-10-13 11:48:39,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 816. [2024-10-13 11:48:39,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 497 states have (on average 1.704225352112676) internal successors, (847), 807 states have internal predecessors, (847), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-13 11:48:39,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 860 transitions. [2024-10-13 11:48:39,975 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 860 transitions. Word has length 65 [2024-10-13 11:48:39,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:39,975 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 860 transitions. [2024-10-13 11:48:39,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 11:48:39,976 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 860 transitions. [2024-10-13 11:48:39,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-13 11:48:39,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:39,978 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:39,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2024-10-13 11:48:40,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:40,179 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:40,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:40,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1730437161, now seen corresponding path program 1 times [2024-10-13 11:48:40,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:40,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854859017] [2024-10-13 11:48:40,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:40,180 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 [2024-10-13 11:48:40,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:40,181 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:40,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-10-13 11:48:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:40,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:48:40,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:40,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:40,422 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:48:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:40,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:40,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854859017] [2024-10-13 11:48:40,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854859017] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:48:40,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:48:40,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 11:48:40,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300716839] [2024-10-13 11:48:40,469 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:48:40,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 11:48:40,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:40,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 11:48:40,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:48:40,470 INFO L87 Difference]: Start difference. First operand 816 states and 860 transitions. Second operand has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:48:41,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:41,152 INFO L93 Difference]: Finished difference Result 825 states and 874 transitions. [2024-10-13 11:48:41,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 11:48:41,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 66 [2024-10-13 11:48:41,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:41,155 INFO L225 Difference]: With dead ends: 825 [2024-10-13 11:48:41,155 INFO L226 Difference]: Without dead ends: 825 [2024-10-13 11:48:41,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-13 11:48:41,156 INFO L432 NwaCegarLoop]: 645 mSDtfsCounter, 5 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2576 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:41,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2576 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 11:48:41,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2024-10-13 11:48:41,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 824. [2024-10-13 11:48:41,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 504 states have (on average 1.7063492063492063) internal successors, (860), 814 states have internal predecessors, (860), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-13 11:48:41,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 873 transitions. [2024-10-13 11:48:41,172 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 873 transitions. Word has length 66 [2024-10-13 11:48:41,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:41,173 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 873 transitions. [2024-10-13 11:48:41,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:48:41,174 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 873 transitions. [2024-10-13 11:48:41,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-13 11:48:41,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:41,174 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:41,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2024-10-13 11:48:41,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:41,375 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:41,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:41,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1389656186, now seen corresponding path program 2 times [2024-10-13 11:48:41,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:41,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123080033] [2024-10-13 11:48:41,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 11:48:41,376 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 [2024-10-13 11:48:41,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:41,377 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:41,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-10-13 11:48:41,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 11:48:41,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:48:41,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 11:48:41,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:41,786 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:41,786 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:48:41,877 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:41,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:41,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123080033] [2024-10-13 11:48:41,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123080033] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:48:41,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:48:41,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 11:48:41,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71587398] [2024-10-13 11:48:41,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:48:41,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 11:48:41,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:41,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 11:48:41,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 11:48:41,879 INFO L87 Difference]: Start difference. First operand 824 states and 873 transitions. Second operand has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:48:43,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:43,229 INFO L93 Difference]: Finished difference Result 836 states and 892 transitions. [2024-10-13 11:48:43,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 11:48:43,230 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2024-10-13 11:48:43,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:43,232 INFO L225 Difference]: With dead ends: 836 [2024-10-13 11:48:43,232 INFO L226 Difference]: Without dead ends: 834 [2024-10-13 11:48:43,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-13 11:48:43,233 INFO L432 NwaCegarLoop]: 645 mSDtfsCounter, 7 mSDsluCounter, 3220 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3865 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:43,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3865 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 11:48:43,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2024-10-13 11:48:43,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 833. [2024-10-13 11:48:43,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 513 states have (on average 1.6998050682261208) internal successors, (872), 823 states have internal predecessors, (872), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-13 11:48:43,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 885 transitions. [2024-10-13 11:48:43,246 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 885 transitions. Word has length 69 [2024-10-13 11:48:43,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:43,246 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 885 transitions. [2024-10-13 11:48:43,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:48:43,246 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 885 transitions. [2024-10-13 11:48:43,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-13 11:48:43,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:43,247 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:43,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2024-10-13 11:48:43,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:43,447 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:43,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:43,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1759857498, now seen corresponding path program 3 times [2024-10-13 11:48:43,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:43,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878235594] [2024-10-13 11:48:43,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 11:48:43,448 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 [2024-10-13 11:48:43,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:43,449 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:43,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-10-13 11:48:44,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-13 11:48:44,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:48:44,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 11:48:44,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:44,179 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:44,179 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:48:44,584 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:44,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:44,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878235594] [2024-10-13 11:48:44,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878235594] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:48:44,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:48:44,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-13 11:48:44,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119813095] [2024-10-13 11:48:44,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:48:44,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 11:48:44,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:44,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 11:48:44,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-13 11:48:44,586 INFO L87 Difference]: Start difference. First operand 833 states and 885 transitions. Second operand has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:48:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:47,971 INFO L93 Difference]: Finished difference Result 854 states and 921 transitions. [2024-10-13 11:48:47,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 11:48:47,972 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 75 [2024-10-13 11:48:47,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:47,973 INFO L225 Difference]: With dead ends: 854 [2024-10-13 11:48:47,973 INFO L226 Difference]: Without dead ends: 851 [2024-10-13 11:48:47,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 11:48:47,974 INFO L432 NwaCegarLoop]: 645 mSDtfsCounter, 13 mSDsluCounter, 7724 mSDsCounter, 0 mSdLazyCounter, 1586 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 8369 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:47,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 8369 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1586 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 11:48:47,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2024-10-13 11:48:47,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2024-10-13 11:48:47,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 531 states have (on average 1.6854990583804144) internal successors, (895), 841 states have internal predecessors, (895), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-13 11:48:47,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 908 transitions. [2024-10-13 11:48:47,982 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 908 transitions. Word has length 75 [2024-10-13 11:48:47,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:47,982 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 908 transitions. [2024-10-13 11:48:47,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:48:47,982 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 908 transitions. [2024-10-13 11:48:47,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-13 11:48:47,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:47,983 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:47,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2024-10-13 11:48:48,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:48,184 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:48,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:48,185 INFO L85 PathProgramCache]: Analyzing trace with hash -2062550758, now seen corresponding path program 4 times [2024-10-13 11:48:48,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:48,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459212088] [2024-10-13 11:48:48,185 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 11:48:48,185 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 [2024-10-13 11:48:48,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:48,187 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:48,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-10-13 11:48:48,666 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 11:48:48,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:48:48,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 11:48:48,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:48,942 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:48,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:48:49,927 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:49,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:49,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459212088] [2024-10-13 11:48:49,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1459212088] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:48:49,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:48:49,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-13 11:48:49,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089088696] [2024-10-13 11:48:49,928 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:48:49,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 11:48:49,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:49,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 11:48:49,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 11:48:49,930 INFO L87 Difference]: Start difference. First operand 851 states and 908 transitions. Second operand has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:48:57,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:57,587 INFO L93 Difference]: Finished difference Result 888 states and 977 transitions. [2024-10-13 11:48:57,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-13 11:48:57,589 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 87 [2024-10-13 11:48:57,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:57,591 INFO L225 Difference]: With dead ends: 888 [2024-10-13 11:48:57,591 INFO L226 Difference]: Without dead ends: 886 [2024-10-13 11:48:57,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-13 11:48:57,593 INFO L432 NwaCegarLoop]: 645 mSDtfsCounter, 26 mSDsluCounter, 14812 mSDsCounter, 0 mSdLazyCounter, 3764 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 15457 SdHoareTripleChecker+Invalid, 3824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 3764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:57,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 15457 Invalid, 3824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 3764 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-10-13 11:48:57,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-10-13 11:48:57,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 885. [2024-10-13 11:48:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 565 states have (on average 1.665486725663717) internal successors, (941), 875 states have internal predecessors, (941), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-13 11:48:57,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 954 transitions. [2024-10-13 11:48:57,603 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 954 transitions. Word has length 87 [2024-10-13 11:48:57,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:57,604 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 954 transitions. [2024-10-13 11:48:57,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:48:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 954 transitions. [2024-10-13 11:48:57,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-13 11:48:57,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:57,604 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:57,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2024-10-13 11:48:57,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:57,809 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:48:57,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:57,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1405382406, now seen corresponding path program 5 times [2024-10-13 11:48:57,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:57,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998045308] [2024-10-13 11:48:57,810 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 11:48:57,810 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 [2024-10-13 11:48:57,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:57,811 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:57,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-10-13 11:48:58,882 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-13 11:48:58,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:48:58,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-13 11:48:58,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:58,920 INFO L378 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 [2024-10-13 11:48:59,027 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-13 11:48:59,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-10-13 11:48:59,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:48:59,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-10-13 11:48:59,773 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 11:48:59,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-10-13 11:48:59,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-10-13 11:48:59,833 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-13 11:48:59,833 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:49:00,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:49:00,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998045308] [2024-10-13 11:49:00,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998045308] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:49:00,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [310688698] [2024-10-13 11:49:00,124 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 11:49:00,124 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 11:49:00,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 11:49:00,125 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 11:49:00,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process