./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_SFH_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:21:34,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:21:35,050 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:21:35,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:21:35,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:21:35,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:21:35,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:21:35,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:21:35,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:21:35,084 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:21:35,084 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:21:35,085 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:21:35,085 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:21:35,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:21:35,087 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:21:35,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:21:35,088 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:21:35,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:21:35,089 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:21:35,089 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:21:35,089 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:21:35,093 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:21:35,093 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:21:35,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:21:35,094 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:21:35,094 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:21:35,094 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:21:35,095 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:21:35,095 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:21:35,095 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:21:35,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:21:35,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:21:35,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:21:35,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:21:35,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:21:35,097 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:21:35,097 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:21:35,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:21:35,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:21:35,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:21:35,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:21:35,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:21:35,099 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-clean/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-clean/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 -> adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 [2024-10-11 19:21:35,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:21:35,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:21:35,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:21:35,378 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:21:35,379 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:21:35,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2024-10-11 19:21:36,747 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:21:37,052 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:21:37,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2024-10-11 19:21:37,076 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3507005ab/27ea4a3b84dd48b7aac5a1095c9c9269/FLAG4741ec9d5 [2024-10-11 19:21:37,326 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3507005ab/27ea4a3b84dd48b7aac5a1095c9c9269 [2024-10-11 19:21:37,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:21:37,330 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:21:37,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:21:37,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:21:37,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:21:37,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:21:37" (1/1) ... [2024-10-11 19:21:37,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a288ac5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:37, skipping insertion in model container [2024-10-11 19:21:37,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:21:37" (1/1) ... [2024-10-11 19:21:37,393 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:21:37,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:21:37,977 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-11 19:21:37,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@23124ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:37, skipping insertion in model container [2024-10-11 19:21:37,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:21:37,978 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 19:21:37,980 INFO L158 Benchmark]: Toolchain (without parser) took 649.14ms. Allocated memory is still 176.2MB. Free memory was 119.2MB in the beginning and 95.1MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-11 19:21:37,980 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 176.2MB. Free memory is still 136.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:21:37,981 INFO L158 Benchmark]: CACSL2BoogieTranslator took 645.02ms. Allocated memory is still 176.2MB. Free memory was 119.2MB in the beginning and 95.1MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-11 19:21:37,982 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.25ms. Allocated memory is still 176.2MB. Free memory is still 136.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 645.02ms. Allocated memory is still 176.2MB. Free memory was 119.2MB in the beginning and 95.1MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 737]: 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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:21:39,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:21:40,076 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 19:21:40,084 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:21:40,085 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:21:40,118 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:21:40,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:21:40,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:21:40,120 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:21:40,121 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:21:40,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:21:40,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:21:40,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:21:40,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:21:40,123 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:21:40,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:21:40,123 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:21:40,124 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:21:40,124 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:21:40,124 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:21:40,125 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:21:40,125 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:21:40,128 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:21:40,129 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:21:40,129 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:21:40,129 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:21:40,129 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:21:40,129 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:21:40,130 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:21:40,130 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:21:40,130 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:21:40,130 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:21:40,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:21:40,131 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:21:40,131 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:21:40,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:21:40,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:21:40,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:21:40,134 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:21:40,135 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:21:40,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:21:40,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:21:40,135 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:21:40,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:21:40,136 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:21:40,137 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-clean/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-clean/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 -> adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 [2024-10-11 19:21:40,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:21:40,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:21:40,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:21:40,499 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:21:40,500 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:21:40,502 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2024-10-11 19:21:42,115 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:21:42,455 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:21:42,456 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2024-10-11 19:21:42,482 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7acfc65d2/98dad585d51e4dff9348d31a08e59ef5/FLAGc0712f4f1 [2024-10-11 19:21:42,499 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7acfc65d2/98dad585d51e4dff9348d31a08e59ef5 [2024-10-11 19:21:42,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:21:42,503 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:21:42,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:21:42,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:21:42,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:21:42,511 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:21:42" (1/1) ... [2024-10-11 19:21:42,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a284c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:42, skipping insertion in model container [2024-10-11 19:21:42,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:21:42" (1/1) ... [2024-10-11 19:21:42,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:21:43,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:21:43,231 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 19:21:43,242 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:21:43,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:21:43,341 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:21:43,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:21:43,488 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:21:43,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:43 WrapperNode [2024-10-11 19:21:43,489 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:21:43,491 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:21:43,491 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:21:43,491 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:21:43,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:43" (1/1) ... [2024-10-11 19:21:43,551 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:43" (1/1) ... [2024-10-11 19:21:43,630 INFO L138 Inliner]: procedures = 180, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1445 [2024-10-11 19:21:43,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:21:43,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:21:43,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:21:43,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:21:43,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:43" (1/1) ... [2024-10-11 19:21:43,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:43" (1/1) ... [2024-10-11 19:21:43,668 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:43" (1/1) ... [2024-10-11 19:21:43,768 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 24, 323]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 1, 82]. [2024-10-11 19:21:43,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:43" (1/1) ... [2024-10-11 19:21:43,769 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:43" (1/1) ... [2024-10-11 19:21:43,826 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:43" (1/1) ... [2024-10-11 19:21:43,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:43" (1/1) ... [2024-10-11 19:21:43,842 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:43" (1/1) ... [2024-10-11 19:21:43,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:43" (1/1) ... [2024-10-11 19:21:43,869 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:21:43,870 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:21:43,871 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:21:43,871 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:21:43,872 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:43" (1/1) ... [2024-10-11 19:21:43,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:21:43,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:21:43,904 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:21:43,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:21:43,954 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-11 19:21:43,954 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-11 19:21:43,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 19:21:43,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 19:21:43,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 19:21:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 19:21:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 19:21:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 19:21:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 19:21:43,956 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 19:21:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 19:21:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 19:21:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 19:21:43,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 19:21:43,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 19:21:43,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 19:21:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 19:21:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:21:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 19:21:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 19:21:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 19:21:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 19:21:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 19:21:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 19:21:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 19:21:43,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 19:21:43,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 19:21:43,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 19:21:43,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 19:21:43,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:21:43,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 19:21:43,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 19:21:43,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:21:43,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:21:44,230 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:21:44,232 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:21:44,253 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:21:44,293 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:21:44,320 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:21:48,957 INFO L? ?]: Removed 1482 outVars from TransFormulas that were not future-live. [2024-10-11 19:21:48,958 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:21:49,153 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:21:49,154 INFO L314 CfgBuilder]: Removed 83 assume(true) statements. [2024-10-11 19:21:49,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:21:49 BoogieIcfgContainer [2024-10-11 19:21:49,154 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:21:49,157 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:21:49,157 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:21:49,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:21:49,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:21:42" (1/3) ... [2024-10-11 19:21:49,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74ec2789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:21:49, skipping insertion in model container [2024-10-11 19:21:49,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:43" (2/3) ... [2024-10-11 19:21:49,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74ec2789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:21:49, skipping insertion in model container [2024-10-11 19:21:49,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:21:49" (3/3) ... [2024-10-11 19:21:49,164 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test5-1.i [2024-10-11 19:21:49,181 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:21:49,181 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 712 error locations. [2024-10-11 19:21:49,261 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:21:49,268 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;@462d61a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:21:49,269 INFO L334 AbstractCegarLoop]: Starting to check reachability of 712 error locations. [2024-10-11 19:21:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 1304 states, 581 states have (on average 2.5008605851979344) internal successors, (1453), 1294 states have internal predecessors, (1453), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 19:21:49,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 19:21:49,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:49,287 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 19:21:49,287 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-10-11 19:21:49,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:49,292 INFO L85 PathProgramCache]: Analyzing trace with hash 69339645, now seen corresponding path program 1 times [2024-10-11 19:21:49,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:49,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140993422] [2024-10-11 19:21:49,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:49,302 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-11 19:21:49,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:49,304 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:49,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:49,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 19:21:49,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:49,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-11 19:21:49,493 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:49,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:49,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140993422] [2024-10-11 19:21:49,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140993422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:49,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:49,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:21:49,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288896610] [2024-10-11 19:21:49,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:49,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 19:21:49,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:49,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 19:21:49,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 19:21:49,536 INFO L87 Difference]: Start difference. First operand has 1304 states, 581 states have (on average 2.5008605851979344) internal successors, (1453), 1294 states have internal predecessors, (1453), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-11 19:21:50,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:50,197 INFO L93 Difference]: Finished difference Result 1284 states and 1366 transitions. [2024-10-11 19:21:50,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 19:21:50,200 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2024-10-11 19:21:50,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:50,218 INFO L225 Difference]: With dead ends: 1284 [2024-10-11 19:21:50,219 INFO L226 Difference]: Without dead ends: 1283 [2024-10-11 19:21:50,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 19:21:50,225 INFO L432 NwaCegarLoop]: 1227 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:50,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1227 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 19:21:50,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2024-10-11 19:21:50,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2024-10-11 19:21:50,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 572 states have (on average 2.3444055944055946) internal successors, (1341), 1273 states have internal predecessors, (1341), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 19:21:50,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1365 transitions. [2024-10-11 19:21:50,342 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1365 transitions. Word has length 4 [2024-10-11 19:21:50,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:50,343 INFO L471 AbstractCegarLoop]: Abstraction has 1283 states and 1365 transitions. [2024-10-11 19:21:50,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-11 19:21:50,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1365 transitions. [2024-10-11 19:21:50,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 19:21:50,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:50,344 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 19:21:50,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 19:21:50,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:50,547 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-10-11 19:21:50,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:50,548 INFO L85 PathProgramCache]: Analyzing trace with hash 69339707, now seen corresponding path program 1 times [2024-10-11 19:21:50,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:50,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328370069] [2024-10-11 19:21:50,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:50,549 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-11 19:21:50,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:50,553 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:50,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:50,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:21:50,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:50,741 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-11 19:21:50,754 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-11 19:21:50,755 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:50,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:50,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328370069] [2024-10-11 19:21:50,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328370069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:50,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:50,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:21:50,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73262752] [2024-10-11 19:21:50,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:50,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:21:50,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:50,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:21:50,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:50,758 INFO L87 Difference]: Start difference. First operand 1283 states and 1365 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11 19:21:52,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:52,777 INFO L93 Difference]: Finished difference Result 1398 states and 1512 transitions. [2024-10-11 19:21:52,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:21:52,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-10-11 19:21:52,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:52,782 INFO L225 Difference]: With dead ends: 1398 [2024-10-11 19:21:52,783 INFO L226 Difference]: Without dead ends: 1398 [2024-10-11 19:21:52,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 19:21:52,784 INFO L432 NwaCegarLoop]: 788 mSDtfsCounter, 1129 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:52,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 942 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 19:21:52,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2024-10-11 19:21:52,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1191. [2024-10-11 19:21:52,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 572 states have (on average 2.1835664335664338) internal successors, (1249), 1181 states have internal predecessors, (1249), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 19:21:52,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1273 transitions. [2024-10-11 19:21:52,815 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1273 transitions. Word has length 4 [2024-10-11 19:21:52,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:52,816 INFO L471 AbstractCegarLoop]: Abstraction has 1191 states and 1273 transitions. [2024-10-11 19:21:52,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11 19:21:52,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1273 transitions. [2024-10-11 19:21:52,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 19:21:52,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:52,817 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 19:21:52,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:53,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:53,018 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-10-11 19:21:53,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:53,019 INFO L85 PathProgramCache]: Analyzing trace with hash 69339708, now seen corresponding path program 1 times [2024-10-11 19:21:53,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:53,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678628970] [2024-10-11 19:21:53,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:53,019 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-11 19:21:53,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:53,023 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:53,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:53,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:21:53,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:53,157 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-11 19:21:53,176 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-11 19:21:53,177 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:53,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:53,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678628970] [2024-10-11 19:21:53,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678628970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:53,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:53,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:21:53,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874022163] [2024-10-11 19:21:53,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:53,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:21:53,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:53,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:21:53,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:53,179 INFO L87 Difference]: Start difference. First operand 1191 states and 1273 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11 19:21:56,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:56,070 INFO L93 Difference]: Finished difference Result 1678 states and 1810 transitions. [2024-10-11 19:21:56,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:21:56,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-10-11 19:21:56,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:56,076 INFO L225 Difference]: With dead ends: 1678 [2024-10-11 19:21:56,077 INFO L226 Difference]: Without dead ends: 1678 [2024-10-11 19:21:56,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 19:21:56,078 INFO L432 NwaCegarLoop]: 1095 mSDtfsCounter, 691 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:56,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1584 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 19:21:56,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2024-10-11 19:21:56,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1320. [2024-10-11 19:21:56,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 711 states have (on average 2.1533052039381153) internal successors, (1531), 1310 states have internal predecessors, (1531), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 19:21:56,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1555 transitions. [2024-10-11 19:21:56,110 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1555 transitions. Word has length 4 [2024-10-11 19:21:56,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:56,110 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1555 transitions. [2024-10-11 19:21:56,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11 19:21:56,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1555 transitions. [2024-10-11 19:21:56,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 19:21:56,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:56,112 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 19:21:56,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:56,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:56,313 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-10-11 19:21:56,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:56,314 INFO L85 PathProgramCache]: Analyzing trace with hash -2143776862, now seen corresponding path program 1 times [2024-10-11 19:21:56,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:56,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536930170] [2024-10-11 19:21:56,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:56,314 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-11 19:21:56,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:56,318 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:56,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:56,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:21:56,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:56,433 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-11 19:21:56,433 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:56,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:56,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536930170] [2024-10-11 19:21:56,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1536930170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:56,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:56,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:21:56,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311889474] [2024-10-11 19:21:56,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:56,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:21:56,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:56,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:21:56,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:56,436 INFO L87 Difference]: Start difference. First operand 1320 states and 1555 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:57,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:57,580 INFO L93 Difference]: Finished difference Result 2624 states and 3094 transitions. [2024-10-11 19:21:57,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:21:57,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 19:21:57,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:57,592 INFO L225 Difference]: With dead ends: 2624 [2024-10-11 19:21:57,592 INFO L226 Difference]: Without dead ends: 2624 [2024-10-11 19:21:57,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11 19:21:57,595 INFO L432 NwaCegarLoop]: 1339 mSDtfsCounter, 1222 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1233 SdHoareTripleChecker+Valid, 2455 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:57,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1233 Valid, 2455 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:21:57,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2024-10-11 19:21:57,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 1322. [2024-10-11 19:21:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 713 states have (on average 2.150070126227209) internal successors, (1533), 1312 states have internal predecessors, (1533), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 19:21:57,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1557 transitions. [2024-10-11 19:21:57,639 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1557 transitions. Word has length 5 [2024-10-11 19:21:57,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:57,639 INFO L471 AbstractCegarLoop]: Abstraction has 1322 states and 1557 transitions. [2024-10-11 19:21:57,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:57,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1557 transitions. [2024-10-11 19:21:57,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 19:21:57,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:57,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:57,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 19:21:57,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:57,843 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-10-11 19:21:57,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:57,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1077155845, now seen corresponding path program 1 times [2024-10-11 19:21:57,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:57,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084090139] [2024-10-11 19:21:57,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:57,844 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-11 19:21:57,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:57,848 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:57,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:57,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:21:57,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:57,994 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-11 19:21:57,994 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:57,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:57,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084090139] [2024-10-11 19:21:57,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084090139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:57,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:57,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:21:57,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813626902] [2024-10-11 19:21:57,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:57,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:21:57,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:57,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:21:57,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:57,997 INFO L87 Difference]: Start difference. First operand 1322 states and 1557 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-11 19:21:58,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:58,792 INFO L93 Difference]: Finished difference Result 1283 states and 1517 transitions. [2024-10-11 19:21:58,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:21:58,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 19:21:58,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:58,798 INFO L225 Difference]: With dead ends: 1283 [2024-10-11 19:21:58,798 INFO L226 Difference]: Without dead ends: 1283 [2024-10-11 19:21:58,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-11 19:21:58,799 INFO L432 NwaCegarLoop]: 1076 mSDtfsCounter, 61 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 2110 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:58,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 2110 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 19:21:58,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2024-10-11 19:21:58,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2024-10-11 19:21:58,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 698 states have (on average 2.138968481375358) internal successors, (1493), 1273 states have internal predecessors, (1493), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 19:21:58,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1517 transitions. [2024-10-11 19:21:58,821 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1517 transitions. Word has length 10 [2024-10-11 19:21:58,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:58,821 INFO L471 AbstractCegarLoop]: Abstraction has 1283 states and 1517 transitions. [2024-10-11 19:21:58,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-11 19:21:58,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1517 transitions. [2024-10-11 19:21:58,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 19:21:58,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:58,822 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:58,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Ended with exit code 0 [2024-10-11 19:21:59,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:59,023 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-10-11 19:21:59,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:59,023 INFO L85 PathProgramCache]: Analyzing trace with hash 59645407, now seen corresponding path program 1 times [2024-10-11 19:21:59,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:59,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690350443] [2024-10-11 19:21:59,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:59,024 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-11 19:21:59,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:59,025 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:59,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:59,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:21:59,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:59,192 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-11 19:21:59,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:59,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:59,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690350443] [2024-10-11 19:21:59,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [690350443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:59,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:59,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:21:59,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062380746] [2024-10-11 19:21:59,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:59,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:59,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:59,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:59,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:59,195 INFO L87 Difference]: Start difference. First operand 1283 states and 1517 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:00,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:00,028 INFO L93 Difference]: Finished difference Result 1268 states and 1495 transitions. [2024-10-11 19:22:00,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:22:00,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 19:22:00,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:00,033 INFO L225 Difference]: With dead ends: 1268 [2024-10-11 19:22:00,034 INFO L226 Difference]: Without dead ends: 1268 [2024-10-11 19:22:00,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:22:00,035 INFO L432 NwaCegarLoop]: 1045 mSDtfsCounter, 45 mSDsluCounter, 2072 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3117 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:00,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3117 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 19:22:00,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2024-10-11 19:22:00,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1268. [2024-10-11 19:22:00,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 697 states have (on average 2.110473457675753) internal successors, (1471), 1258 states have internal predecessors, (1471), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 19:22:00,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1495 transitions. [2024-10-11 19:22:00,064 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1495 transitions. Word has length 12 [2024-10-11 19:22:00,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:00,064 INFO L471 AbstractCegarLoop]: Abstraction has 1268 states and 1495 transitions. [2024-10-11 19:22:00,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:00,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1495 transitions. [2024-10-11 19:22:00,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 19:22:00,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:00,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] [2024-10-11 19:22:00,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 19:22:00,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:00,266 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-10-11 19:22:00,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:00,267 INFO L85 PathProgramCache]: Analyzing trace with hash -578247475, now seen corresponding path program 1 times [2024-10-11 19:22:00,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:00,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794824655] [2024-10-11 19:22:00,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:00,267 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-11 19:22:00,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:00,269 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:00,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:00,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:22:00,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:00,426 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-11 19:22:00,489 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-11 19:22:00,489 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:00,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:00,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794824655] [2024-10-11 19:22:00,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794824655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:00,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:00,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:22:00,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191987859] [2024-10-11 19:22:00,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:00,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:22:00,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:00,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:22:00,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:22:00,491 INFO L87 Difference]: Start difference. First operand 1268 states and 1495 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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-11 19:22:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:02,211 INFO L93 Difference]: Finished difference Result 1268 states and 1495 transitions. [2024-10-11 19:22:02,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:22:02,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2024-10-11 19:22:02,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:02,216 INFO L225 Difference]: With dead ends: 1268 [2024-10-11 19:22:02,216 INFO L226 Difference]: Without dead ends: 1268 [2024-10-11 19:22:02,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-11 19:22:02,217 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 1073 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:02,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 1029 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 19:22:02,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2024-10-11 19:22:02,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1264. [2024-10-11 19:22:02,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 697 states have (on average 2.104734576757532) internal successors, (1467), 1254 states have internal predecessors, (1467), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 19:22:02,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1491 transitions. [2024-10-11 19:22:02,236 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1491 transitions. Word has length 26 [2024-10-11 19:22:02,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:02,236 INFO L471 AbstractCegarLoop]: Abstraction has 1264 states and 1491 transitions. [2024-10-11 19:22:02,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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-11 19:22:02,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1491 transitions. [2024-10-11 19:22:02,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 19:22:02,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:02,237 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] [2024-10-11 19:22:02,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 19:22:02,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:02,438 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-10-11 19:22:02,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:02,439 INFO L85 PathProgramCache]: Analyzing trace with hash -578247474, now seen corresponding path program 1 times [2024-10-11 19:22:02,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:02,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2143790692] [2024-10-11 19:22:02,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:02,439 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-11 19:22:02,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:02,440 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:02,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:02,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:22:02,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:02,585 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-11 19:22:02,785 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-11 19:22:02,785 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:02,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:02,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2143790692] [2024-10-11 19:22:02,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2143790692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:02,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:02,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:22:02,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142240710] [2024-10-11 19:22:02,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:02,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:22:02,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:02,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:22:02,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:22:02,786 INFO L87 Difference]: Start difference. First operand 1264 states and 1491 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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-11 19:22:05,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:05,981 INFO L93 Difference]: Finished difference Result 1623 states and 1747 transitions. [2024-10-11 19:22:05,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:22:05,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2024-10-11 19:22:05,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:05,987 INFO L225 Difference]: With dead ends: 1623 [2024-10-11 19:22:05,988 INFO L226 Difference]: Without dead ends: 1623 [2024-10-11 19:22:05,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-11 19:22:05,989 INFO L432 NwaCegarLoop]: 844 mSDtfsCounter, 631 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:05,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 1829 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 19:22:05,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2024-10-11 19:22:06,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1260. [2024-10-11 19:22:06,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 697 states have (on average 2.0989956958393114) internal successors, (1463), 1250 states have internal predecessors, (1463), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 19:22:06,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1487 transitions. [2024-10-11 19:22:06,011 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1487 transitions. Word has length 26 [2024-10-11 19:22:06,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:06,011 INFO L471 AbstractCegarLoop]: Abstraction has 1260 states and 1487 transitions. [2024-10-11 19:22:06,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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-11 19:22:06,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1487 transitions. [2024-10-11 19:22:06,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 19:22:06,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:06,013 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] [2024-10-11 19:22:06,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-11 19:22:06,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:06,214 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-10-11 19:22:06,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:06,215 INFO L85 PathProgramCache]: Analyzing trace with hash 649968199, now seen corresponding path program 1 times [2024-10-11 19:22:06,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:06,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530621855] [2024-10-11 19:22:06,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:06,215 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-11 19:22:06,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:06,218 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:06,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:06,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:22:06,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:06,468 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-11 19:22:06,468 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:06,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:06,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530621855] [2024-10-11 19:22:06,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530621855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:06,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:06,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:22:06,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307328497] [2024-10-11 19:22:06,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:06,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:22:06,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:06,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:22:06,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:22:06,469 INFO L87 Difference]: Start difference. First operand 1260 states and 1487 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:07,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:07,188 INFO L93 Difference]: Finished difference Result 1254 states and 1477 transitions. [2024-10-11 19:22:07,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:22:07,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-10-11 19:22:07,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:07,193 INFO L225 Difference]: With dead ends: 1254 [2024-10-11 19:22:07,193 INFO L226 Difference]: Without dead ends: 1254 [2024-10-11 19:22:07,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-11 19:22:07,193 INFO L432 NwaCegarLoop]: 1039 mSDtfsCounter, 15 mSDsluCounter, 2061 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3100 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:07,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3100 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 19:22:07,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-10-11 19:22:07,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1254. [2024-10-11 19:22:07,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 691 states have (on average 2.1027496382054993) internal successors, (1453), 1244 states have internal predecessors, (1453), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 19:22:07,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1477 transitions. [2024-10-11 19:22:07,213 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1477 transitions. Word has length 42 [2024-10-11 19:22:07,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:07,213 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1477 transitions. [2024-10-11 19:22:07,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:07,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1477 transitions. [2024-10-11 19:22:07,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 19:22:07,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:07,215 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] [2024-10-11 19:22:07,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:07,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:07,416 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-10-11 19:22:07,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:07,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1995728295, now seen corresponding path program 1 times [2024-10-11 19:22:07,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:07,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611059769] [2024-10-11 19:22:07,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:07,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:07,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:07,420 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:07,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:07,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:22:07,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:07,872 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-11 19:22:07,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:07,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:07,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611059769] [2024-10-11 19:22:07,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611059769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:07,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:07,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:22:07,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660181104] [2024-10-11 19:22:07,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:07,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:22:07,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:07,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:22:07,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:22:07,875 INFO L87 Difference]: Start difference. First operand 1254 states and 1477 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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-11 19:22:08,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:08,469 INFO L93 Difference]: Finished difference Result 1297 states and 1520 transitions. [2024-10-11 19:22:08,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:22:08,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-11 19:22:08,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:08,474 INFO L225 Difference]: With dead ends: 1297 [2024-10-11 19:22:08,475 INFO L226 Difference]: Without dead ends: 1297 [2024-10-11 19:22:08,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-11 19:22:08,475 INFO L432 NwaCegarLoop]: 1054 mSDtfsCounter, 0 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2082 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:08,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2082 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 19:22:08,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2024-10-11 19:22:08,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1297. [2024-10-11 19:22:08,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1297 states, 734 states have (on average 2.0381471389645776) internal successors, (1496), 1287 states have internal predecessors, (1496), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 19:22:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1520 transitions. [2024-10-11 19:22:08,495 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1520 transitions. Word has length 46 [2024-10-11 19:22:08,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:08,495 INFO L471 AbstractCegarLoop]: Abstraction has 1297 states and 1520 transitions. [2024-10-11 19:22:08,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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-11 19:22:08,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1520 transitions. [2024-10-11 19:22:08,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 19:22:08,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:08,496 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] [2024-10-11 19:22:08,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:08,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:08,697 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-10-11 19:22:08,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:08,698 INFO L85 PathProgramCache]: Analyzing trace with hash -598097142, now seen corresponding path program 1 times [2024-10-11 19:22:08,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:08,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836028606] [2024-10-11 19:22:08,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:08,699 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-11 19:22:08,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:08,702 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:08,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:08,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:22:08,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:08,984 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-11 19:22:08,993 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-11 19:22:09,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:22:09,419 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-11 19:22:09,435 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:22:09,436 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-11 19:22:09,452 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-11 19:22:09,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:09,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:09,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836028606] [2024-10-11 19:22:09,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [836028606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:09,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:09,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:22:09,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382648052] [2024-10-11 19:22:09,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:09,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:22:09,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:09,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:22:09,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:22:09,454 INFO L87 Difference]: Start difference. First operand 1297 states and 1520 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 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-11 19:22:11,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:11,223 INFO L93 Difference]: Finished difference Result 1213 states and 1436 transitions. [2024-10-11 19:22:11,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:22:11,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 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 49 [2024-10-11 19:22:11,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:11,227 INFO L225 Difference]: With dead ends: 1213 [2024-10-11 19:22:11,227 INFO L226 Difference]: Without dead ends: 1213 [2024-10-11 19:22:11,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 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-11 19:22:11,227 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 1009 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:11,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1020 Valid, 313 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 19:22:11,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2024-10-11 19:22:11,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1074. [2024-10-11 19:22:11,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 595 states have (on average 1.8823529411764706) internal successors, (1120), 1064 states have internal predecessors, (1120), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 19:22:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1144 transitions. [2024-10-11 19:22:11,248 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1144 transitions. Word has length 49 [2024-10-11 19:22:11,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:11,248 INFO L471 AbstractCegarLoop]: Abstraction has 1074 states and 1144 transitions. [2024-10-11 19:22:11,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 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-11 19:22:11,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1144 transitions. [2024-10-11 19:22:11,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 19:22:11,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:11,249 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] [2024-10-11 19:22:11,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Ended with exit code 0 [2024-10-11 19:22:11,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:11,452 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-10-11 19:22:11,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:11,453 INFO L85 PathProgramCache]: Analyzing trace with hash 867084466, now seen corresponding path program 1 times [2024-10-11 19:22:11,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:11,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437084210] [2024-10-11 19:22:11,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:11,454 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-11 19:22:11,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:11,457 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:11,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:11,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:22:11,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:11,697 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-11 19:22:11,713 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-11 19:22:11,732 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-11 19:22:11,742 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-11 19:22:11,742 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:11,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:11,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437084210] [2024-10-11 19:22:11,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1437084210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:11,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:11,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:22:11,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934306268] [2024-10-11 19:22:11,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:11,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:22:11,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:11,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:22:11,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:22:11,745 INFO L87 Difference]: Start difference. First operand 1074 states and 1144 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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-11 19:22:13,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:13,948 INFO L93 Difference]: Finished difference Result 1073 states and 1143 transitions. [2024-10-11 19:22:13,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:22:13,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2024-10-11 19:22:13,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:13,952 INFO L225 Difference]: With dead ends: 1073 [2024-10-11 19:22:13,952 INFO L226 Difference]: Without dead ends: 1073 [2024-10-11 19:22:13,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 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-11 19:22:13,953 INFO L432 NwaCegarLoop]: 967 mSDtfsCounter, 2 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 1838 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2546 SdHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:13,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2546 Invalid, 1839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1838 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 19:22:13,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2024-10-11 19:22:13,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1073. [2024-10-11 19:22:13,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1073 states, 595 states have (on average 1.880672268907563) internal successors, (1119), 1063 states have internal predecessors, (1119), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 19:22:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1143 transitions. [2024-10-11 19:22:13,967 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1143 transitions. Word has length 53 [2024-10-11 19:22:13,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:13,968 INFO L471 AbstractCegarLoop]: Abstraction has 1073 states and 1143 transitions. [2024-10-11 19:22:13,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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-11 19:22:13,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1143 transitions. [2024-10-11 19:22:13,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 19:22:13,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:13,970 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] [2024-10-11 19:22:13,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:14,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:14,171 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-10-11 19:22:14,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:14,172 INFO L85 PathProgramCache]: Analyzing trace with hash 867084467, now seen corresponding path program 1 times [2024-10-11 19:22:14,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:14,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472831282] [2024-10-11 19:22:14,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:14,173 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-11 19:22:14,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:14,176 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:14,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:14,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 19:22:14,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:14,417 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-11 19:22:14,450 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-11 19:22:14,460 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-11 19:22:14,492 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-11 19:22:14,507 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-11 19:22:14,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:14,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:14,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472831282] [2024-10-11 19:22:14,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472831282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:14,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:14,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:22:14,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725036124] [2024-10-11 19:22:14,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:14,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:22:14,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:14,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:22:14,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:22:14,509 INFO L87 Difference]: Start difference. First operand 1073 states and 1143 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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-11 19:22:17,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:17,144 INFO L93 Difference]: Finished difference Result 1072 states and 1142 transitions. [2024-10-11 19:22:17,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:22:17,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2024-10-11 19:22:17,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:17,147 INFO L225 Difference]: With dead ends: 1072 [2024-10-11 19:22:17,148 INFO L226 Difference]: Without dead ends: 1072 [2024-10-11 19:22:17,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 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-11 19:22:17,148 INFO L432 NwaCegarLoop]: 967 mSDtfsCounter, 1 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 1813 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2568 SdHoareTripleChecker+Invalid, 1814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:17,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2568 Invalid, 1814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1813 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 19:22:17,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2024-10-11 19:22:17,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2024-10-11 19:22:17,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 594 states have (on average 1.8821548821548821) internal successors, (1118), 1062 states have internal predecessors, (1118), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 19:22:17,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1142 transitions. [2024-10-11 19:22:17,162 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1142 transitions. Word has length 53 [2024-10-11 19:22:17,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:17,162 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1142 transitions. [2024-10-11 19:22:17,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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-11 19:22:17,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1142 transitions. [2024-10-11 19:22:17,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 19:22:17,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:17,164 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-11 19:22:17,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:17,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:17,364 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-10-11 19:22:17,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:17,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1865914218, now seen corresponding path program 1 times [2024-10-11 19:22:17,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:17,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049567669] [2024-10-11 19:22:17,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:17,365 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-11 19:22:17,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:17,367 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:17,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:17,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:22:17,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:17,612 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-11 19:22:17,616 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:17,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:17,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049567669] [2024-10-11 19:22:17,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049567669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:17,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:17,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:22:17,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016180974] [2024-10-11 19:22:17,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:17,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:22:17,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:17,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:22:17,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:22:17,619 INFO L87 Difference]: Start difference. First operand 1072 states and 1142 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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-11 19:22:18,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:18,342 INFO L93 Difference]: Finished difference Result 1074 states and 1146 transitions. [2024-10-11 19:22:18,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:22:18,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 59 [2024-10-11 19:22:18,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:18,346 INFO L225 Difference]: With dead ends: 1074 [2024-10-11 19:22:18,346 INFO L226 Difference]: Without dead ends: 1074 [2024-10-11 19:22:18,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 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-11 19:22:18,347 INFO L432 NwaCegarLoop]: 966 mSDtfsCounter, 0 mSDsluCounter, 1926 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2892 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:18,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2892 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 19:22:18,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2024-10-11 19:22:18,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1074. [2024-10-11 19:22:18,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 595 states have (on average 1.8823529411764706) internal successors, (1120), 1064 states have internal predecessors, (1120), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-11 19:22:18,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1146 transitions. [2024-10-11 19:22:18,362 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1146 transitions. Word has length 59 [2024-10-11 19:22:18,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:18,362 INFO L471 AbstractCegarLoop]: Abstraction has 1074 states and 1146 transitions. [2024-10-11 19:22:18,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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-11 19:22:18,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1146 transitions. [2024-10-11 19:22:18,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 19:22:18,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:18,364 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] [2024-10-11 19:22:18,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:18,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:18,565 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-10-11 19:22:18,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:18,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2064716728, now seen corresponding path program 1 times [2024-10-11 19:22:18,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:18,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842047505] [2024-10-11 19:22:18,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:18,566 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-11 19:22:18,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:18,569 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:18,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:18,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:22:18,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:18,904 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-11 19:22:18,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:22:18,966 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-11 19:22:18,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:18,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842047505] [2024-10-11 19:22:18,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [842047505] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:22:18,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:22:18,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 19:22:18,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769478322] [2024-10-11 19:22:18,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:22:18,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 19:22:18,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:18,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 19:22:18,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 19:22:18,969 INFO L87 Difference]: Start difference. First operand 1074 states and 1146 transitions. Second operand has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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-11 19:22:19,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:19,961 INFO L93 Difference]: Finished difference Result 1083 states and 1161 transitions. [2024-10-11 19:22:19,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:22:19,961 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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 60 [2024-10-11 19:22:19,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:19,965 INFO L225 Difference]: With dead ends: 1083 [2024-10-11 19:22:19,965 INFO L226 Difference]: Without dead ends: 1083 [2024-10-11 19:22:19,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-11 19:22:19,965 INFO L432 NwaCegarLoop]: 964 mSDtfsCounter, 4 mSDsluCounter, 2884 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3848 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:19,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3848 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 19:22:19,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2024-10-11 19:22:19,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1082. [2024-10-11 19:22:19,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 602 states have (on average 1.8820598006644518) internal successors, (1133), 1071 states have internal predecessors, (1133), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-11 19:22:19,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1159 transitions. [2024-10-11 19:22:19,981 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1159 transitions. Word has length 60 [2024-10-11 19:22:19,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:19,981 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1159 transitions. [2024-10-11 19:22:19,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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-11 19:22:19,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1159 transitions. [2024-10-11 19:22:19,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 19:22:19,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:19,982 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] [2024-10-11 19:22:19,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:20,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:20,184 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-10-11 19:22:20,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:20,184 INFO L85 PathProgramCache]: Analyzing trace with hash 858464534, now seen corresponding path program 2 times [2024-10-11 19:22:20,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:20,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985344707] [2024-10-11 19:22:20,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:22:20,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-11 19:22:20,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:20,188 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:20,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:20,540 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 19:22:20,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:22:20,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:22:20,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:20,590 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-11 19:22:20,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:22:20,734 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-11 19:22:20,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:20,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985344707] [2024-10-11 19:22:20,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985344707] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:22:20,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:22:20,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-11 19:22:20,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609787626] [2024-10-11 19:22:20,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:22:20,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 19:22:20,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:20,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 19:22:20,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 19:22:20,736 INFO L87 Difference]: Start difference. First operand 1082 states and 1159 transitions. Second operand has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 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-11 19:22:22,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:22,438 INFO L93 Difference]: Finished difference Result 1094 states and 1179 transitions. [2024-10-11 19:22:22,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 19:22:22,439 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 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 63 [2024-10-11 19:22:22,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:22,442 INFO L225 Difference]: With dead ends: 1094 [2024-10-11 19:22:22,442 INFO L226 Difference]: Without dead ends: 1092 [2024-10-11 19:22:22,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-11 19:22:22,443 INFO L432 NwaCegarLoop]: 964 mSDtfsCounter, 7 mSDsluCounter, 5770 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 6734 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:22,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 6734 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 19:22:22,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2024-10-11 19:22:22,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1091. [2024-10-11 19:22:22,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 611 states have (on average 1.873977086743044) internal successors, (1145), 1080 states have internal predecessors, (1145), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-11 19:22:22,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1171 transitions. [2024-10-11 19:22:22,456 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1171 transitions. Word has length 63 [2024-10-11 19:22:22,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:22,456 INFO L471 AbstractCegarLoop]: Abstraction has 1091 states and 1171 transitions. [2024-10-11 19:22:22,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 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-11 19:22:22,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1171 transitions. [2024-10-11 19:22:22,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 19:22:22,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:22,458 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] [2024-10-11 19:22:22,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Ended with exit code 0 [2024-10-11 19:22:22,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:22,659 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-10-11 19:22:22,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:22,661 INFO L85 PathProgramCache]: Analyzing trace with hash 755678678, now seen corresponding path program 3 times [2024-10-11 19:22:22,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:22,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425724949] [2024-10-11 19:22:22,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:22:22,661 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-11 19:22:22,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:22,664 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:22,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:23,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-11 19:22:23,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:22:23,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 19:22:23,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:23,360 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-11 19:22:23,360 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:22:23,802 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-11 19:22:23,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:23,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425724949] [2024-10-11 19:22:23,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1425724949] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:22:23,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:22:23,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-11 19:22:23,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751016720] [2024-10-11 19:22:23,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:22:23,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 19:22:23,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:23,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 19:22:23,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-11 19:22:23,804 INFO L87 Difference]: Start difference. First operand 1091 states and 1171 transitions. Second operand has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 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-11 19:22:27,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:27,783 INFO L93 Difference]: Finished difference Result 1112 states and 1207 transitions. [2024-10-11 19:22:27,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-11 19:22:27,784 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 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-11 19:22:27,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:27,787 INFO L225 Difference]: With dead ends: 1112 [2024-10-11 19:22:27,788 INFO L226 Difference]: Without dead ends: 1109 [2024-10-11 19:22:27,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 112 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-11 19:22:27,789 INFO L432 NwaCegarLoop]: 964 mSDtfsCounter, 13 mSDsluCounter, 11536 mSDsCounter, 0 mSdLazyCounter, 2241 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 12500 SdHoareTripleChecker+Invalid, 2252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:27,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 12500 Invalid, 2252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2241 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 19:22:27,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2024-10-11 19:22:27,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2024-10-11 19:22:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 629 states have (on average 1.8569157392686804) internal successors, (1168), 1098 states have internal predecessors, (1168), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-11 19:22:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1194 transitions. [2024-10-11 19:22:27,801 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1194 transitions. Word has length 69 [2024-10-11 19:22:27,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:27,801 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1194 transitions. [2024-10-11 19:22:27,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 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-11 19:22:27,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1194 transitions. [2024-10-11 19:22:27,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 19:22:27,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:27,803 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] [2024-10-11 19:22:27,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-11 19:22:28,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:28,004 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-10-11 19:22:28,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:28,004 INFO L85 PathProgramCache]: Analyzing trace with hash -636729514, now seen corresponding path program 4 times [2024-10-11 19:22:28,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:28,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658996746] [2024-10-11 19:22:28,005 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 19:22:28,005 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-11 19:22:28,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:28,006 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:28,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:28,443 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 19:22:28,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:22:28,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 19:22:28,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:28,770 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-11 19:22:28,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:22:29,862 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-11 19:22:29,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:29,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658996746] [2024-10-11 19:22:29,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658996746] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:22:29,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:22:29,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-11 19:22:29,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68072172] [2024-10-11 19:22:29,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:22:29,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-11 19:22:29,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:29,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-11 19:22:29,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 19:22:29,866 INFO L87 Difference]: Start difference. First operand 1109 states and 1194 transitions. Second operand has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 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-11 19:22:38,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:38,692 INFO L93 Difference]: Finished difference Result 1146 states and 1264 transitions. [2024-10-11 19:22:38,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-11 19:22:38,692 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 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 81 [2024-10-11 19:22:38,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:38,696 INFO L225 Difference]: With dead ends: 1146 [2024-10-11 19:22:38,696 INFO L226 Difference]: Without dead ends: 1144 [2024-10-11 19:22:38,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-11 19:22:38,698 INFO L432 NwaCegarLoop]: 964 mSDtfsCounter, 26 mSDsluCounter, 22126 mSDsCounter, 0 mSdLazyCounter, 5022 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 23090 SdHoareTripleChecker+Invalid, 5125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 5022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:38,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 23090 Invalid, 5125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 5022 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-10-11 19:22:38,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2024-10-11 19:22:38,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1143. [2024-10-11 19:22:38,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 663 states have (on average 1.8310708898944192) internal successors, (1214), 1132 states have internal predecessors, (1214), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-11 19:22:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1240 transitions. [2024-10-11 19:22:38,713 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1240 transitions. Word has length 81 [2024-10-11 19:22:38,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:38,713 INFO L471 AbstractCegarLoop]: Abstraction has 1143 states and 1240 transitions. [2024-10-11 19:22:38,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 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-11 19:22:38,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1240 transitions. [2024-10-11 19:22:38,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 19:22:38,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:38,715 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] [2024-10-11 19:22:38,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:38,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:38,916 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-10-11 19:22:38,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:38,916 INFO L85 PathProgramCache]: Analyzing trace with hash 656971286, now seen corresponding path program 5 times [2024-10-11 19:22:38,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:38,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49033869] [2024-10-11 19:22:38,917 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:22:38,917 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-11 19:22:38,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:38,918 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:38,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:40,014 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-11 19:22:40,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:22:40,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-11 19:22:40,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:40,054 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-11 19:22:40,131 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-11 19:22:40,131 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-11 19:22:40,175 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-11 19:22:40,267 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-11 19:22:41,284 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 19:22:41,285 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-11 19:22:41,323 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-11 19:22:41,353 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-11 19:22:41,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:22:41,729 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1688 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1688) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-10-11 19:22:41,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:41,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49033869] [2024-10-11 19:22:41,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49033869] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:22:41,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [594659582] [2024-10-11 19:22:41,731 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:22:41,731 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 19:22:41,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 19:22:41,733 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 19:22:41,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process