./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb2eb63835edf753d5a467feb7a4cdd6d105155177d7d0cab8bf29c1b74dbaf6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 15:36:51,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 15:36:51,310 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 15:36:51,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 15:36:51,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 15:36:51,356 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 15:36:51,357 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 15:36:51,358 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 15:36:51,358 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 15:36:51,359 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 15:36:51,360 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 15:36:51,360 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 15:36:51,361 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 15:36:51,362 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 15:36:51,364 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 15:36:51,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 15:36:51,364 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 15:36:51,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 15:36:51,365 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 15:36:51,365 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 15:36:51,366 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 15:36:51,369 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 15:36:51,370 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 15:36:51,370 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 15:36:51,370 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 15:36:51,371 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 15:36:51,371 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 15:36:51,371 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 15:36:51,372 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 15:36:51,372 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 15:36:51,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 15:36:51,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 15:36:51,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 15:36:51,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 15:36:51,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 15:36:51,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 15:36:51,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 15:36:51,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 15:36:51,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 15:36:51,375 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 15:36:51,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 15:36:51,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 15:36:51,376 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eb2eb63835edf753d5a467feb7a4cdd6d105155177d7d0cab8bf29c1b74dbaf6 [2024-11-12 15:36:51,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 15:36:51,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 15:36:51,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 15:36:51,700 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 15:36:51,701 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 15:36:51,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i [2024-11-12 15:36:53,218 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 15:36:53,511 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 15:36:53,512 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i [2024-11-12 15:36:53,531 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3071f6bb/aa0b1c44d593480585080e6a645be298/FLAG849598113 [2024-11-12 15:36:53,791 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3071f6bb/aa0b1c44d593480585080e6a645be298 [2024-11-12 15:36:53,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 15:36:53,795 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 15:36:53,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 15:36:53,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 15:36:53,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 15:36:53,803 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:36:53" (1/1) ... [2024-11-12 15:36:53,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bade43e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:36:53, skipping insertion in model container [2024-11-12 15:36:53,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:36:53" (1/1) ... [2024-11-12 15:36:53,866 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 15:36:54,359 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:54,394 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:54,398 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:54,402 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:54,409 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:54,440 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:54,441 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:54,443 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:54,443 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:54,446 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:54,448 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:54,449 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:54,450 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:54,453 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:54,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:36:54,481 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-11-12 15:36:54,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1d655e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:36:54, skipping insertion in model container [2024-11-12 15:36:54,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 15:36:54,483 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-12 15:36:54,484 INFO L158 Benchmark]: Toolchain (without parser) took 688.75ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 85.2MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-12 15:36:54,485 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 167.8MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 15:36:54,485 INFO L158 Benchmark]: CACSL2BoogieTranslator took 686.40ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 85.9MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-12 15:36:54,487 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.11ms. Allocated memory is still 167.8MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 686.40ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 85.9MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 747]: 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb2eb63835edf753d5a467feb7a4cdd6d105155177d7d0cab8bf29c1b74dbaf6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 15:36:56,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 15:36:56,788 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-12 15:36:56,793 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 15:36:56,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 15:36:56,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 15:36:56,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 15:36:56,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 15:36:56,821 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 15:36:56,821 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 15:36:56,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 15:36:56,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 15:36:56,823 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 15:36:56,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 15:36:56,823 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 15:36:56,824 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 15:36:56,824 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 15:36:56,827 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 15:36:56,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 15:36:56,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 15:36:56,828 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 15:36:56,832 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 15:36:56,832 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 15:36:56,833 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 15:36:56,833 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 15:36:56,833 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 15:36:56,833 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 15:36:56,834 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 15:36:56,834 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 15:36:56,834 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 15:36:56,834 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 15:36:56,835 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 15:36:56,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 15:36:56,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 15:36:56,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 15:36:56,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 15:36:56,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 15:36:56,838 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 15:36:56,838 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 15:36:56,838 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 15:36:56,839 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 15:36:56,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 15:36:56,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 15:36:56,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 15:36:56,840 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eb2eb63835edf753d5a467feb7a4cdd6d105155177d7d0cab8bf29c1b74dbaf6 [2024-11-12 15:36:57,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 15:36:57,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 15:36:57,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 15:36:57,218 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 15:36:57,219 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 15:36:57,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i [2024-11-12 15:36:58,775 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 15:36:59,096 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 15:36:59,097 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i [2024-11-12 15:36:59,118 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb718e58a/c8c350fdb0eb490ca5f1f990f790dcb3/FLAGb67ffed8d [2024-11-12 15:36:59,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb718e58a/c8c350fdb0eb490ca5f1f990f790dcb3 [2024-11-12 15:36:59,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 15:36:59,135 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 15:36:59,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 15:36:59,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 15:36:59,142 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 15:36:59,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:36:59" (1/1) ... [2024-11-12 15:36:59,144 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e992462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:36:59, skipping insertion in model container [2024-11-12 15:36:59,144 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:36:59" (1/1) ... [2024-11-12 15:36:59,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 15:36:59,658 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,702 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,708 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,717 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,725 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,767 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,767 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,771 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,772 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,774 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,776 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,777 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,778 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,783 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:36:59,809 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-12 15:36:59,828 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 15:36:59,859 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,883 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,885 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,887 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,894 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,921 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,922 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,923 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,924 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,925 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,926 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,927 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,928 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,930 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:36:59,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:36:59,943 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 15:37:00,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:37:00,065 INFO L204 MainTranslator]: Completed translation [2024-11-12 15:37:00,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:37:00 WrapperNode [2024-11-12 15:37:00,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 15:37:00,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 15:37:00,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 15:37:00,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 15:37:00,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:37:00" (1/1) ... [2024-11-12 15:37:00,123 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:37:00" (1/1) ... [2024-11-12 15:37:00,179 INFO L138 Inliner]: procedures = 180, calls = 279, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1069 [2024-11-12 15:37:00,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 15:37:00,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 15:37:00,184 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 15:37:00,184 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 15:37:00,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:37:00" (1/1) ... [2024-11-12 15:37:00,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:37:00" (1/1) ... [2024-11-12 15:37:00,213 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:37:00" (1/1) ... [2024-11-12 15:37:00,303 INFO L175 MemorySlicer]: Split 255 memory accesses to 3 slices as follows [2, 219, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-11-12 15:37:00,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:37:00" (1/1) ... [2024-11-12 15:37:00,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:37:00" (1/1) ... [2024-11-12 15:37:00,342 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:37:00" (1/1) ... [2024-11-12 15:37:00,357 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:37:00" (1/1) ... [2024-11-12 15:37:00,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:37:00" (1/1) ... [2024-11-12 15:37:00,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:37:00" (1/1) ... [2024-11-12 15:37:00,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 15:37:00,379 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 15:37:00,379 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 15:37:00,379 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 15:37:00,380 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:37:00" (1/1) ... [2024-11-12 15:37:00,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 15:37:00,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:37:00,425 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 15:37:00,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 15:37:00,477 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-12 15:37:00,477 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-12 15:37:00,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 15:37:00,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 15:37:00,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-12 15:37:00,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 15:37:00,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 15:37:00,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-12 15:37:00,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 15:37:00,478 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 15:37:00,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-12 15:37:00,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-12 15:37:00,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-12 15:37:00,479 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-12 15:37:00,479 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-12 15:37:00,479 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-12 15:37:00,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 15:37:00,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 15:37:00,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 15:37:00,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 15:37:00,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 15:37:00,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 15:37:00,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 15:37:00,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 15:37:00,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 15:37:00,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 15:37:00,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 15:37:00,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 15:37:00,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-12 15:37:00,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 15:37:00,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 15:37:00,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-12 15:37:00,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 15:37:00,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 15:37:00,714 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 15:37:00,716 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 15:37:00,737 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-12 15:37:00,774 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-12 15:37:00,801 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-12 15:37:04,728 INFO L? ?]: Removed 1092 outVars from TransFormulas that were not future-live. [2024-11-12 15:37:04,728 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 15:37:04,774 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 15:37:04,777 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-12 15:37:04,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:37:04 BoogieIcfgContainer [2024-11-12 15:37:04,778 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 15:37:04,779 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 15:37:04,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 15:37:04,784 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 15:37:04,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:36:59" (1/3) ... [2024-11-12 15:37:04,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7151ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:37:04, skipping insertion in model container [2024-11-12 15:37:04,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:37:00" (2/3) ... [2024-11-12 15:37:04,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7151ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:37:04, skipping insertion in model container [2024-11-12 15:37:04,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:37:04" (3/3) ... [2024-11-12 15:37:04,789 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test3-1.i [2024-11-12 15:37:04,808 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 15:37:04,809 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 527 error locations. [2024-11-12 15:37:04,880 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 15:37:04,886 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;@3069fd41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 15:37:04,886 INFO L334 AbstractCegarLoop]: Starting to check reachability of 527 error locations. [2024-11-12 15:37:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 1074 states, 536 states have (on average 2.218283582089552) internal successors, (1189), 1067 states have internal predecessors, (1189), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 15:37:04,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-12 15:37:04,896 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:37:04,897 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-12 15:37:04,897 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-12 15:37:04,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:37:04,903 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2024-11-12 15:37:04,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:37:04,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144183685] [2024-11-12 15:37:04,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:37:04,915 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-11-12 15:37:04,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:37:04,916 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:37:04,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 15:37:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:37:05,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 15:37:05,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:37:05,093 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-11-12 15:37:05,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:37:05,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:37:05,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:37:05,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144183685] [2024-11-12 15:37:05,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144183685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:37:05,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:37:05,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 15:37:05,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658468376] [2024-11-12 15:37:05,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:37:05,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:37:05,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:37:05,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:37:05,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:37:05,192 INFO L87 Difference]: Start difference. First operand has 1074 states, 536 states have (on average 2.218283582089552) internal successors, (1189), 1067 states have internal predecessors, (1189), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:37:06,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:37:06,888 INFO L93 Difference]: Finished difference Result 1069 states and 1135 transitions. [2024-11-12 15:37:06,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:37:06,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-12 15:37:06,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:37:06,909 INFO L225 Difference]: With dead ends: 1069 [2024-11-12 15:37:06,910 INFO L226 Difference]: Without dead ends: 1067 [2024-11-12 15:37:06,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:37:06,915 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 979 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-12 15:37:06,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 715 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-12 15:37:06,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2024-11-12 15:37:07,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1059. [2024-11-12 15:37:07,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 538 states have (on average 2.057620817843866) internal successors, (1107), 1052 states have internal predecessors, (1107), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 15:37:07,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1125 transitions. [2024-11-12 15:37:07,018 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1125 transitions. Word has length 3 [2024-11-12 15:37:07,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:37:07,018 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1125 transitions. [2024-11-12 15:37:07,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:37:07,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1125 transitions. [2024-11-12 15:37:07,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-12 15:37:07,019 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:37:07,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-12 15:37:07,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 15:37:07,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:37:07,222 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-12 15:37:07,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:37:07,223 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2024-11-12 15:37:07,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:37:07,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28179649] [2024-11-12 15:37:07,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:37:07,224 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-11-12 15:37:07,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:37:07,225 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:37:07,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 15:37:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:37:07,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 15:37:07,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:37:07,348 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-11-12 15:37:07,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:37:07,365 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:37:07,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:37:07,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28179649] [2024-11-12 15:37:07,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28179649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:37:07,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:37:07,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 15:37:07,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157716617] [2024-11-12 15:37:07,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:37:07,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:37:07,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:37:07,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:37:07,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:37:07,369 INFO L87 Difference]: Start difference. First operand 1059 states and 1125 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:37:09,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:37:09,502 INFO L93 Difference]: Finished difference Result 1477 states and 1585 transitions. [2024-11-12 15:37:09,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:37:09,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-12 15:37:09,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:37:09,509 INFO L225 Difference]: With dead ends: 1477 [2024-11-12 15:37:09,509 INFO L226 Difference]: Without dead ends: 1477 [2024-11-12 15:37:09,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:37:09,511 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 448 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-12 15:37:09,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1517 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-12 15:37:09,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2024-11-12 15:37:09,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1267. [2024-11-12 15:37:09,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1267 states, 747 states have (on average 2.0468540829986615) internal successors, (1529), 1260 states have internal predecessors, (1529), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 15:37:09,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 1547 transitions. [2024-11-12 15:37:09,549 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 1547 transitions. Word has length 3 [2024-11-12 15:37:09,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:37:09,549 INFO L471 AbstractCegarLoop]: Abstraction has 1267 states and 1547 transitions. [2024-11-12 15:37:09,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:37:09,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1547 transitions. [2024-11-12 15:37:09,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 15:37:09,550 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:37:09,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:37:09,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 15:37:09,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:37:09,751 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-12 15:37:09,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:37:09,752 INFO L85 PathProgramCache]: Analyzing trace with hash 458521935, now seen corresponding path program 1 times [2024-11-12 15:37:09,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:37:09,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274119182] [2024-11-12 15:37:09,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:37:09,753 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-11-12 15:37:09,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:37:09,757 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:37:09,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 15:37:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:37:09,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 15:37:09,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:37:09,915 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-11-12 15:37:09,924 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-11-12 15:37:09,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 15:37:09,991 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-11-12 15:37:10,008 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 15:37:10,009 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-11-12 15:37:10,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:37:10,035 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:37:10,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:37:10,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274119182] [2024-11-12 15:37:10,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274119182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:37:10,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:37:10,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:37:10,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757798785] [2024-11-12 15:37:10,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:37:10,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:37:10,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:37:10,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:37:10,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:37:10,038 INFO L87 Difference]: Start difference. First operand 1267 states and 1547 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:37:12,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:37:12,459 INFO L93 Difference]: Finished difference Result 1269 states and 1551 transitions. [2024-11-12 15:37:12,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:37:12,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-12 15:37:12,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:37:12,464 INFO L225 Difference]: With dead ends: 1269 [2024-11-12 15:37:12,465 INFO L226 Difference]: Without dead ends: 1269 [2024-11-12 15:37:12,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:37:12,466 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 2047 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2055 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-12 15:37:12,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2055 Valid, 424 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-12 15:37:12,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2024-11-12 15:37:12,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1047. [2024-11-12 15:37:12,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 538 states have (on average 2.033457249070632) internal successors, (1094), 1040 states have internal predecessors, (1094), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 15:37:12,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1112 transitions. [2024-11-12 15:37:12,490 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1112 transitions. Word has length 7 [2024-11-12 15:37:12,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:37:12,492 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1112 transitions. [2024-11-12 15:37:12,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:37:12,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1112 transitions. [2024-11-12 15:37:12,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 15:37:12,493 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:37:12,494 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:37:12,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-12 15:37:12,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:37:12,698 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-12 15:37:12,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:37:12,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278099, now seen corresponding path program 1 times [2024-11-12 15:37:12,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:37:12,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525670485] [2024-11-12 15:37:12,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:37:12,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-11-12 15:37:12,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:37:12,701 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:37:12,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 15:37:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:37:12,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 15:37:12,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:37:12,827 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-11-12 15:37:12,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:37:12,854 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:37:12,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:37:12,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525670485] [2024-11-12 15:37:12,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1525670485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:37:12,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:37:12,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 15:37:12,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256076989] [2024-11-12 15:37:12,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:37:12,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:37:12,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:37:12,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:37:12,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:37:12,857 INFO L87 Difference]: Start difference. First operand 1047 states and 1112 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:37:15,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:37:15,319 INFO L93 Difference]: Finished difference Result 1518 states and 1620 transitions. [2024-11-12 15:37:15,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:37:15,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-12 15:37:15,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:37:15,325 INFO L225 Difference]: With dead ends: 1518 [2024-11-12 15:37:15,325 INFO L226 Difference]: Without dead ends: 1518 [2024-11-12 15:37:15,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:37:15,326 INFO L435 NwaCegarLoop]: 1199 mSDtfsCounter, 691 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-12 15:37:15,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1643 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-12 15:37:15,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-11-12 15:37:15,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1074. [2024-11-12 15:37:15,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 575 states have (on average 2.0208695652173914) internal successors, (1162), 1067 states have internal predecessors, (1162), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 15:37:15,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1180 transitions. [2024-11-12 15:37:15,354 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1180 transitions. Word has length 8 [2024-11-12 15:37:15,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:37:15,355 INFO L471 AbstractCegarLoop]: Abstraction has 1074 states and 1180 transitions. [2024-11-12 15:37:15,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:37:15,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1180 transitions. [2024-11-12 15:37:15,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 15:37:15,356 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:37:15,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:37:15,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-12 15:37:15,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:37:15,558 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-12 15:37:15,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:37:15,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278098, now seen corresponding path program 1 times [2024-11-12 15:37:15,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:37:15,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889136456] [2024-11-12 15:37:15,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:37:15,559 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-11-12 15:37:15,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:37:15,560 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:37:15,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 15:37:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:37:15,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 15:37:15,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:37:15,670 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-11-12 15:37:15,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:37:15,680 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:37:15,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:37:15,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889136456] [2024-11-12 15:37:15,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889136456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:37:15,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:37:15,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 15:37:15,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299027520] [2024-11-12 15:37:15,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:37:15,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:37:15,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:37:15,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:37:15,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:37:15,683 INFO L87 Difference]: Start difference. First operand 1074 states and 1180 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:37:17,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:37:17,019 INFO L93 Difference]: Finished difference Result 1407 states and 1539 transitions. [2024-11-12 15:37:17,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:37:17,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-12 15:37:17,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:37:17,023 INFO L225 Difference]: With dead ends: 1407 [2024-11-12 15:37:17,024 INFO L226 Difference]: Without dead ends: 1407 [2024-11-12 15:37:17,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:37:17,024 INFO L435 NwaCegarLoop]: 969 mSDtfsCounter, 939 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 15:37:17,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 1216 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 15:37:17,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2024-11-12 15:37:17,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1025. [2024-11-12 15:37:17,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 575 states have (on average 1.9286956521739131) internal successors, (1109), 1018 states have internal predecessors, (1109), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 15:37:17,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1127 transitions. [2024-11-12 15:37:17,044 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1127 transitions. Word has length 8 [2024-11-12 15:37:17,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:37:17,045 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1127 transitions. [2024-11-12 15:37:17,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:37:17,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1127 transitions. [2024-11-12 15:37:17,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 15:37:17,045 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:37:17,046 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:37:17,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-12 15:37:17,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:37:17,247 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-12 15:37:17,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:37:17,248 INFO L85 PathProgramCache]: Analyzing trace with hash -285594881, now seen corresponding path program 1 times [2024-11-12 15:37:17,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:37:17,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89711005] [2024-11-12 15:37:17,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:37:17,249 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-11-12 15:37:17,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:37:17,252 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:37:17,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 15:37:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:37:17,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 15:37:17,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:37:17,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:37:17,455 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:37:17,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:37:17,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89711005] [2024-11-12 15:37:17,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89711005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:37:17,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:37:17,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:37:17,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658561413] [2024-11-12 15:37:17,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:37:17,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:37:17,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:37:17,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:37:17,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:37:17,457 INFO L87 Difference]: Start difference. First operand 1025 states and 1127 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:37:18,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:37:18,002 INFO L93 Difference]: Finished difference Result 1450 states and 1607 transitions. [2024-11-12 15:37:18,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:37:18,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-12 15:37:18,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:37:18,007 INFO L225 Difference]: With dead ends: 1450 [2024-11-12 15:37:18,007 INFO L226 Difference]: Without dead ends: 1450 [2024-11-12 15:37:18,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:37:18,008 INFO L435 NwaCegarLoop]: 1113 mSDtfsCounter, 449 mSDsluCounter, 1971 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 3084 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 15:37:18,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 3084 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 15:37:18,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2024-11-12 15:37:18,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1270. [2024-11-12 15:37:18,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 820 states have (on average 1.9134146341463414) internal successors, (1569), 1263 states have internal predecessors, (1569), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 15:37:18,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1587 transitions. [2024-11-12 15:37:18,030 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1587 transitions. Word has length 11 [2024-11-12 15:37:18,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:37:18,031 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 1587 transitions. [2024-11-12 15:37:18,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:37:18,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1587 transitions. [2024-11-12 15:37:18,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 15:37:18,031 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:37:18,032 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:37:18,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-12 15:37:18,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:37:18,232 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr525ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-12 15:37:18,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:37:18,233 INFO L85 PathProgramCache]: Analyzing trace with hash -263505449, now seen corresponding path program 1 times [2024-11-12 15:37:18,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:37:18,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210225452] [2024-11-12 15:37:18,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:37:18,234 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-11-12 15:37:18,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:37:18,236 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:37:18,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 15:37:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:37:18,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 15:37:18,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:37:18,401 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 15:37:18,402 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 15:37:18,402 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 15:37:18,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-12 15:37:18,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 15:37:18,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-12 15:37:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:37:18,484 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:37:18,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:37:18,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1210225452] [2024-11-12 15:37:18,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1210225452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:37:18,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:37:18,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:37:18,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916198048] [2024-11-12 15:37:18,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:37:18,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:37:18,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:37:18,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:37:18,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:37:18,486 INFO L87 Difference]: Start difference. First operand 1270 states and 1587 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-11-12 15:37:18,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:37:18,903 INFO L93 Difference]: Finished difference Result 2189 states and 2611 transitions. [2024-11-12 15:37:18,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:37:18,903 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-11-12 15:37:18,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:37:18,909 INFO L225 Difference]: With dead ends: 2189 [2024-11-12 15:37:18,909 INFO L226 Difference]: Without dead ends: 2189 [2024-11-12 15:37:18,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:37:18,910 INFO L435 NwaCegarLoop]: 1225 mSDtfsCounter, 964 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 3443 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 15:37:18,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 3443 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 15:37:18,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2024-11-12 15:37:18,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 1269. [2024-11-12 15:37:18,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 819 states have (on average 1.9133089133089134) internal successors, (1567), 1262 states have internal predecessors, (1567), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 15:37:18,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1585 transitions. [2024-11-12 15:37:18,945 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 1585 transitions. Word has length 12 [2024-11-12 15:37:18,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:37:18,945 INFO L471 AbstractCegarLoop]: Abstraction has 1269 states and 1585 transitions. [2024-11-12 15:37:18,945 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-11-12 15:37:18,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1585 transitions. [2024-11-12 15:37:18,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 15:37:18,946 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:37:18,946 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:37:18,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-12 15:37:19,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:37:19,147 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-12 15:37:19,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:37:19,148 INFO L85 PathProgramCache]: Analyzing trace with hash 183846334, now seen corresponding path program 1 times [2024-11-12 15:37:19,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:37:19,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786192503] [2024-11-12 15:37:19,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:37:19,148 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:37:19,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:37:19,149 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:37:19,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-12 15:37:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:37:19,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 15:37:19,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:37:19,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:37:19,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:37:19,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:37:19,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786192503] [2024-11-12 15:37:19,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786192503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:37:19,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:37:19,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:37:19,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759004747] [2024-11-12 15:37:19,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:37:19,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:37:19,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:37:19,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:37:19,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:37:19,321 INFO L87 Difference]: Start difference. First operand 1269 states and 1585 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:37:19,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:37:19,354 INFO L93 Difference]: Finished difference Result 1209 states and 1499 transitions. [2024-11-12 15:37:19,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:37:19,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-12 15:37:19,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:37:19,358 INFO L225 Difference]: With dead ends: 1209 [2024-11-12 15:37:19,358 INFO L226 Difference]: Without dead ends: 1209 [2024-11-12 15:37:19,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-11-12 15:37:19,359 INFO L435 NwaCegarLoop]: 990 mSDtfsCounter, 71 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1917 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 15:37:19,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1917 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:37:19,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2024-11-12 15:37:19,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1209. [2024-11-12 15:37:19,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 783 states have (on average 1.8914431673052363) internal successors, (1481), 1202 states have internal predecessors, (1481), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 15:37:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1499 transitions. [2024-11-12 15:37:19,392 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1499 transitions. Word has length 18 [2024-11-12 15:37:19,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:37:19,393 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1499 transitions. [2024-11-12 15:37:19,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:37:19,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1499 transitions. [2024-11-12 15:37:19,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 15:37:19,394 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:37:19,394 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:37:19,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-12 15:37:19,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:37:19,595 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-12 15:37:19,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:37:19,596 INFO L85 PathProgramCache]: Analyzing trace with hash 582665080, now seen corresponding path program 1 times [2024-11-12 15:37:19,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:37:19,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281622382] [2024-11-12 15:37:19,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:37:19,597 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-11-12 15:37:19,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:37:19,598 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:37:19,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-12 15:37:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:37:19,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 15:37:19,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:37:19,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:37:19,770 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:37:19,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:37:19,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281622382] [2024-11-12 15:37:19,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281622382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:37:19,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:37:19,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:37:19,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521526511] [2024-11-12 15:37:19,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:37:19,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:37:19,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:37:19,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:37:19,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:37:19,771 INFO L87 Difference]: Start difference. First operand 1209 states and 1499 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-11-12 15:37:19,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:37:19,833 INFO L93 Difference]: Finished difference Result 1179 states and 1441 transitions. [2024-11-12 15:37:19,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 15:37:19,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2024-11-12 15:37:19,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:37:19,837 INFO L225 Difference]: With dead ends: 1179 [2024-11-12 15:37:19,837 INFO L226 Difference]: Without dead ends: 1179 [2024-11-12 15:37:19,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-11-12 15:37:19,838 INFO L435 NwaCegarLoop]: 945 mSDtfsCounter, 48 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2809 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 15:37:19,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2809 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:37:19,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2024-11-12 15:37:19,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1179. [2024-11-12 15:37:19,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 767 states have (on average 1.8552803129074316) internal successors, (1423), 1172 states have internal predecessors, (1423), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 15:37:19,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1441 transitions. [2024-11-12 15:37:19,857 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1441 transitions. Word has length 20 [2024-11-12 15:37:19,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:37:19,858 INFO L471 AbstractCegarLoop]: Abstraction has 1179 states and 1441 transitions. [2024-11-12 15:37:19,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-11-12 15:37:19,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1441 transitions. [2024-11-12 15:37:19,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-12 15:37:19,859 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:37:19,859 INFO L218 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] [2024-11-12 15:37:19,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-12 15:37:20,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:37:20,060 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-12 15:37:20,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:37:20,060 INFO L85 PathProgramCache]: Analyzing trace with hash -195006074, now seen corresponding path program 1 times [2024-11-12 15:37:20,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:37:20,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963205903] [2024-11-12 15:37:20,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:37:20,061 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-11-12 15:37:20,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:37:20,062 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:37:20,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-12 15:37:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:37:20,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 15:37:20,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:37:20,221 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-11-12 15:37:20,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:37:20,297 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:37:20,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:37:20,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963205903] [2024-11-12 15:37:20,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963205903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:37:20,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:37:20,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:37:20,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227812993] [2024-11-12 15:37:20,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:37:20,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:37:20,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:37:20,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:37:20,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:37:20,298 INFO L87 Difference]: Start difference. First operand 1179 states and 1441 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:37:22,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:37:22,180 INFO L93 Difference]: Finished difference Result 1639 states and 2022 transitions. [2024-11-12 15:37:22,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:37:22,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-12 15:37:22,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:37:22,184 INFO L225 Difference]: With dead ends: 1639 [2024-11-12 15:37:22,185 INFO L226 Difference]: Without dead ends: 1639 [2024-11-12 15:37:22,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-11-12 15:37:22,185 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 872 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-12 15:37:22,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 1222 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-12 15:37:22,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2024-11-12 15:37:22,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1175. [2024-11-12 15:37:22,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 767 states have (on average 1.8448500651890483) internal successors, (1415), 1168 states have internal predecessors, (1415), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 15:37:22,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1433 transitions. [2024-11-12 15:37:22,208 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1433 transitions. Word has length 34 [2024-11-12 15:37:22,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:37:22,208 INFO L471 AbstractCegarLoop]: Abstraction has 1175 states and 1433 transitions. [2024-11-12 15:37:22,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:37:22,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1433 transitions. [2024-11-12 15:37:22,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-12 15:37:22,209 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:37:22,210 INFO L218 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] [2024-11-12 15:37:22,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-12 15:37:22,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:37:22,410 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-12 15:37:22,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:37:22,411 INFO L85 PathProgramCache]: Analyzing trace with hash -195006073, now seen corresponding path program 1 times [2024-11-12 15:37:22,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:37:22,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169057966] [2024-11-12 15:37:22,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:37:22,412 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-11-12 15:37:22,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:37:22,413 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:37:22,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-12 15:37:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:37:22,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 15:37:22,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:37:22,591 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-11-12 15:37:22,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:37:22,796 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:37:22,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:37:22,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169057966] [2024-11-12 15:37:22,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [169057966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:37:22,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:37:22,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:37:22,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723828528] [2024-11-12 15:37:22,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:37:22,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:37:22,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:37:22,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:37:22,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:37:22,799 INFO L87 Difference]: Start difference. First operand 1175 states and 1433 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:37:25,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:37:25,235 INFO L93 Difference]: Finished difference Result 1780 states and 2186 transitions. [2024-11-12 15:37:25,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:37:25,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-12 15:37:25,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:37:25,241 INFO L225 Difference]: With dead ends: 1780 [2024-11-12 15:37:25,241 INFO L226 Difference]: Without dead ends: 1780 [2024-11-12 15:37:25,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-11-12 15:37:25,242 INFO L435 NwaCegarLoop]: 1209 mSDtfsCounter, 620 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 1356 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 2420 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-12 15:37:25,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 2420 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1356 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-12 15:37:25,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2024-11-12 15:37:25,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1171. [2024-11-12 15:37:25,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 767 states have (on average 1.834419817470665) internal successors, (1407), 1164 states have internal predecessors, (1407), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 15:37:25,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1425 transitions. [2024-11-12 15:37:25,264 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1425 transitions. Word has length 34 [2024-11-12 15:37:25,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:37:25,265 INFO L471 AbstractCegarLoop]: Abstraction has 1171 states and 1425 transitions. [2024-11-12 15:37:25,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:37:25,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1425 transitions. [2024-11-12 15:37:25,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-12 15:37:25,267 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:37:25,267 INFO L218 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-11-12 15:37:25,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-12 15:37:25,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:37:25,468 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-12 15:37:25,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:37:25,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1181697534, now seen corresponding path program 1 times [2024-11-12 15:37:25,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:37:25,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648011568] [2024-11-12 15:37:25,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:37:25,469 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-11-12 15:37:25,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:37:25,472 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:37:25,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-12 15:37:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:37:25,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 15:37:25,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:37:25,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:37:25,718 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:37:25,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:37:25,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [648011568] [2024-11-12 15:37:25,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [648011568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:37:25,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:37:25,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:37:25,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806339690] [2024-11-12 15:37:25,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:37:25,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:37:25,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:37:25,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:37:25,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:37:25,720 INFO L87 Difference]: Start difference. First operand 1171 states and 1425 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-11-12 15:37:25,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:37:25,773 INFO L93 Difference]: Finished difference Result 1159 states and 1405 transitions. [2024-11-12 15:37:25,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 15:37:25,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-11-12 15:37:25,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:37:25,788 INFO L225 Difference]: With dead ends: 1159 [2024-11-12 15:37:25,788 INFO L226 Difference]: Without dead ends: 1159 [2024-11-12 15:37:25,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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-11-12 15:37:25,790 INFO L435 NwaCegarLoop]: 939 mSDtfsCounter, 21 mSDsluCounter, 1847 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2786 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 15:37:25,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2786 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:37:25,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2024-11-12 15:37:25,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1159. [2024-11-12 15:37:25,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 755 states have (on average 1.8370860927152317) internal successors, (1387), 1152 states have internal predecessors, (1387), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 15:37:25,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1405 transitions. [2024-11-12 15:37:25,808 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1405 transitions. Word has length 53 [2024-11-12 15:37:25,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:37:25,808 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1405 transitions. [2024-11-12 15:37:25,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-11-12 15:37:25,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1405 transitions. [2024-11-12 15:37:25,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-12 15:37:25,812 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:37:25,812 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:37:25,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-12 15:37:26,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:37:26,014 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-12 15:37:26,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:37:26,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1740051530, now seen corresponding path program 1 times [2024-11-12 15:37:26,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:37:26,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818524955] [2024-11-12 15:37:26,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:37:26,016 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-11-12 15:37:26,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:37:26,019 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:37:26,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-12 15:37:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:37:26,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 15:37:26,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:37:26,320 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-11-12 15:37:26,330 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-11-12 15:37:26,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 15:37:26,855 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-11-12 15:37:26,868 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 15:37:26,869 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-11-12 15:37:26,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:37:26,881 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:37:26,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:37:26,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818524955] [2024-11-12 15:37:26,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818524955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:37:26,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:37:26,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:37:26,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433981087] [2024-11-12 15:37:26,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:37:26,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:37:26,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:37:26,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:37:26,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:37:26,883 INFO L87 Difference]: Start difference. First operand 1159 states and 1405 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:37:28,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:37:28,634 INFO L93 Difference]: Finished difference Result 1577 states and 1948 transitions. [2024-11-12 15:37:28,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:37:28,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-12 15:37:28,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:37:28,640 INFO L225 Difference]: With dead ends: 1577 [2024-11-12 15:37:28,641 INFO L226 Difference]: Without dead ends: 1577 [2024-11-12 15:37:28,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 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-11-12 15:37:28,641 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 1981 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1984 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-12 15:37:28,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1984 Valid, 528 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-12 15:37:28,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2024-11-12 15:37:28,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1084. [2024-11-12 15:37:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 718 states have (on average 1.775766016713092) internal successors, (1275), 1077 states have internal predecessors, (1275), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 15:37:28,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1293 transitions. [2024-11-12 15:37:28,674 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1293 transitions. Word has length 61 [2024-11-12 15:37:28,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:37:28,674 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1293 transitions. [2024-11-12 15:37:28,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:37:28,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1293 transitions. [2024-11-12 15:37:28,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 15:37:28,678 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:37:28,678 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:37:28,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-12 15:37:28,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:37:28,878 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-12 15:37:28,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:37:28,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1654454369, now seen corresponding path program 1 times [2024-11-12 15:37:28,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:37:28,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684963308] [2024-11-12 15:37:28,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:37:28,880 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-11-12 15:37:28,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:37:28,882 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:37:28,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-12 15:37:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:37:29,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 15:37:29,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:37:29,139 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-11-12 15:37:29,155 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-11-12 15:37:29,178 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-11-12 15:37:29,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:37:29,187 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:37:29,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:37:29,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684963308] [2024-11-12 15:37:29,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1684963308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:37:29,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:37:29,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:37:29,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576941506] [2024-11-12 15:37:29,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:37:29,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 15:37:29,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:37:29,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 15:37:29,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:37:29,190 INFO L87 Difference]: Start difference. First operand 1084 states and 1293 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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-11-12 15:37:30,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:37:30,680 INFO L93 Difference]: Finished difference Result 1083 states and 1292 transitions. [2024-11-12 15:37:30,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 15:37:30,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 66 [2024-11-12 15:37:30,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:37:30,683 INFO L225 Difference]: With dead ends: 1083 [2024-11-12 15:37:30,683 INFO L226 Difference]: Without dead ends: 1083 [2024-11-12 15:37:30,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 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-11-12 15:37:30,684 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 2 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2376 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-12 15:37:30,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2376 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-12 15:37:30,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2024-11-12 15:37:30,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1083. [2024-11-12 15:37:30,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 718 states have (on average 1.7743732590529249) internal successors, (1274), 1076 states have internal predecessors, (1274), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 15:37:30,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1292 transitions. [2024-11-12 15:37:30,698 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1292 transitions. Word has length 66 [2024-11-12 15:37:30,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:37:30,699 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1292 transitions. [2024-11-12 15:37:30,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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-11-12 15:37:30,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1292 transitions. [2024-11-12 15:37:30,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 15:37:30,699 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:37:30,700 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:37:30,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-12 15:37:30,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:37:30,900 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-12 15:37:30,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:37:30,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1654454368, now seen corresponding path program 1 times [2024-11-12 15:37:30,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:37:30,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700735965] [2024-11-12 15:37:30,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:37:30,901 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-11-12 15:37:30,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:37:30,902 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:37:30,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-12 15:37:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:37:31,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 15:37:31,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:37:31,162 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-11-12 15:37:31,181 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-11-12 15:37:31,192 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-11-12 15:37:31,230 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-11-12 15:37:31,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:37:31,243 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:37:31,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:37:31,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700735965] [2024-11-12 15:37:31,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [700735965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:37:31,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:37:31,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:37:31,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872646374] [2024-11-12 15:37:31,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:37:31,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 15:37:31,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:37:31,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 15:37:31,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:37:31,245 INFO L87 Difference]: Start difference. First operand 1083 states and 1292 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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-11-12 15:37:33,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:37:33,161 INFO L93 Difference]: Finished difference Result 1082 states and 1291 transitions. [2024-11-12 15:37:33,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 15:37:33,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 66 [2024-11-12 15:37:33,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:37:33,164 INFO L225 Difference]: With dead ends: 1082 [2024-11-12 15:37:33,164 INFO L226 Difference]: Without dead ends: 1082 [2024-11-12 15:37:33,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 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-11-12 15:37:33,165 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 1 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2410 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-12 15:37:33,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2410 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-12 15:37:33,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2024-11-12 15:37:33,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1082. [2024-11-12 15:37:33,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 717 states have (on average 1.7754532775453278) internal successors, (1273), 1075 states have internal predecessors, (1273), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 15:37:33,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1291 transitions. [2024-11-12 15:37:33,177 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1291 transitions. Word has length 66 [2024-11-12 15:37:33,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:37:33,177 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1291 transitions. [2024-11-12 15:37:33,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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-11-12 15:37:33,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1291 transitions. [2024-11-12 15:37:33,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-12 15:37:33,178 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:37:33,178 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:37:33,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-12 15:37:33,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:37:33,379 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-12 15:37:33,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:37:33,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1296768858, now seen corresponding path program 1 times [2024-11-12 15:37:33,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:37:33,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47385306] [2024-11-12 15:37:33,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:37:33,380 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-11-12 15:37:33,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:37:33,381 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:37:33,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-12 15:37:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:37:33,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 15:37:33,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:37:33,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:37:33,690 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:37:33,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:37:33,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47385306] [2024-11-12 15:37:33,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [47385306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:37:33,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:37:33,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:37:33,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176069421] [2024-11-12 15:37:33,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:37:33,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:37:33,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:37:33,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:37:33,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:37:33,693 INFO L87 Difference]: Start difference. First operand 1082 states and 1291 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-11-12 15:37:33,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:37:33,742 INFO L93 Difference]: Finished difference Result 1085 states and 1295 transitions. [2024-11-12 15:37:33,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:37:33,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 74 [2024-11-12 15:37:33,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:37:33,747 INFO L225 Difference]: With dead ends: 1085 [2024-11-12 15:37:33,751 INFO L226 Difference]: Without dead ends: 1085 [2024-11-12 15:37:33,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 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-11-12 15:37:33,752 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 0 mSDsluCounter, 1819 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2731 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 15:37:33,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2731 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:37:33,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2024-11-12 15:37:33,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1085. [2024-11-12 15:37:33,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 719 states have (on average 1.7746870653685674) internal successors, (1276), 1078 states have internal predecessors, (1276), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-12 15:37:33,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1295 transitions. [2024-11-12 15:37:33,775 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1295 transitions. Word has length 74 [2024-11-12 15:37:33,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:37:33,775 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1295 transitions. [2024-11-12 15:37:33,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-11-12 15:37:33,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1295 transitions. [2024-11-12 15:37:33,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-12 15:37:33,776 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:37:33,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:37:33,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-12 15:37:33,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:37:33,977 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-12 15:37:33,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:37:33,978 INFO L85 PathProgramCache]: Analyzing trace with hash -582851754, now seen corresponding path program 1 times [2024-11-12 15:37:33,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:37:33,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192290226] [2024-11-12 15:37:33,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:37:33,979 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-11-12 15:37:33,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:37:33,982 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:37:33,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-12 15:37:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:37:34,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 15:37:34,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:37:34,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:37:34,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:37:34,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:37:34,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:37:34,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192290226] [2024-11-12 15:37:34,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192290226] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:37:34,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:37:34,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-12 15:37:34,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732275487] [2024-11-12 15:37:34,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:37:34,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 15:37:34,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:37:34,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 15:37:34,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 15:37:34,351 INFO L87 Difference]: Start difference. First operand 1085 states and 1295 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-11-12 15:37:34,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:37:34,475 INFO L93 Difference]: Finished difference Result 1097 states and 1312 transitions. [2024-11-12 15:37:34,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 15:37:34,476 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 75 [2024-11-12 15:37:34,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:37:34,480 INFO L225 Difference]: With dead ends: 1097 [2024-11-12 15:37:34,480 INFO L226 Difference]: Without dead ends: 1097 [2024-11-12 15:37:34,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 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-11-12 15:37:34,481 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 5 mSDsluCounter, 5447 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6359 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 15:37:34,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6359 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 15:37:34,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2024-11-12 15:37:34,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1095. [2024-11-12 15:37:34,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 728 states have (on average 1.7733516483516483) internal successors, (1291), 1087 states have internal predecessors, (1291), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-12 15:37:34,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1310 transitions. [2024-11-12 15:37:34,497 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1310 transitions. Word has length 75 [2024-11-12 15:37:34,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:37:34,497 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1310 transitions. [2024-11-12 15:37:34,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-11-12 15:37:34,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1310 transitions. [2024-11-12 15:37:34,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-12 15:37:34,501 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:37:34,501 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:37:34,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-12 15:37:34,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:37:34,701 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-12 15:37:34,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:37:34,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1420292954, now seen corresponding path program 2 times [2024-11-12 15:37:34,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:37:34,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114158564] [2024-11-12 15:37:34,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 15:37:34,703 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-11-12 15:37:34,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:37:34,704 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:37:34,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-12 15:37:35,093 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 15:37:35,094 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:37:35,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 15:37:35,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:37:35,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:37:35,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:37:35,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:37:35,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:37:35,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114158564] [2024-11-12 15:37:35,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114158564] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:37:35,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:37:35,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-12 15:37:35,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486082757] [2024-11-12 15:37:35,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:37:35,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 15:37:35,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:37:35,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 15:37:35,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-12 15:37:35,259 INFO L87 Difference]: Start difference. First operand 1095 states and 1310 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 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-11-12 15:37:35,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:37:35,585 INFO L93 Difference]: Finished difference Result 1110 states and 1332 transitions. [2024-11-12 15:37:35,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 15:37:35,586 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 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 78 [2024-11-12 15:37:35,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:37:35,589 INFO L225 Difference]: With dead ends: 1110 [2024-11-12 15:37:35,589 INFO L226 Difference]: Without dead ends: 1106 [2024-11-12 15:37:35,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-12 15:37:35,590 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 10 mSDsluCounter, 4548 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5460 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 15:37:35,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5460 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 15:37:35,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2024-11-12 15:37:35,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1104. [2024-11-12 15:37:35,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 737 states have (on average 1.7679782903663501) internal successors, (1303), 1096 states have internal predecessors, (1303), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-12 15:37:35,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1322 transitions. [2024-11-12 15:37:35,605 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1322 transitions. Word has length 78 [2024-11-12 15:37:35,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:37:35,605 INFO L471 AbstractCegarLoop]: Abstraction has 1104 states and 1322 transitions. [2024-11-12 15:37:35,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 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-11-12 15:37:35,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1322 transitions. [2024-11-12 15:37:35,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-12 15:37:35,606 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:37:35,606 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:37:35,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-12 15:37:35,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:37:35,807 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-12 15:37:35,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:37:35,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1518367066, now seen corresponding path program 3 times [2024-11-12 15:37:35,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:37:35,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119442961] [2024-11-12 15:37:35,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 15:37:35,808 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-11-12 15:37:35,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:37:35,811 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:37:35,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-12 15:37:36,495 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-12 15:37:36,495 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:37:36,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 15:37:36,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:37:36,633 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:37:36,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:37:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:37:37,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:37:37,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119442961] [2024-11-12 15:37:37,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2119442961] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:37:37,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:37:37,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-12 15:37:37,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12011775] [2024-11-12 15:37:37,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:37:37,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-12 15:37:37,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:37:37,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-12 15:37:37,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-12 15:37:37,089 INFO L87 Difference]: Start difference. First operand 1104 states and 1322 transitions. Second operand has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 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-11-12 15:37:38,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:37:38,397 INFO L93 Difference]: Finished difference Result 1128 states and 1361 transitions. [2024-11-12 15:37:38,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-12 15:37:38,397 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 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 84 [2024-11-12 15:37:38,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:37:38,401 INFO L225 Difference]: With dead ends: 1128 [2024-11-12 15:37:38,401 INFO L226 Difference]: Without dead ends: 1122 [2024-11-12 15:37:38,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 142 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-11-12 15:37:38,402 INFO L435 NwaCegarLoop]: 913 mSDtfsCounter, 22 mSDsluCounter, 10918 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 11831 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 15:37:38,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 11831 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 15:37:38,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2024-11-12 15:37:38,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2024-11-12 15:37:38,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 755 states have (on average 1.7562913907284767) internal successors, (1326), 1114 states have internal predecessors, (1326), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-12 15:37:38,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1345 transitions. [2024-11-12 15:37:38,416 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1345 transitions. Word has length 84 [2024-11-12 15:37:38,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:37:38,416 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1345 transitions. [2024-11-12 15:37:38,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 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-11-12 15:37:38,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1345 transitions. [2024-11-12 15:37:38,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 15:37:38,417 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:37:38,418 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:37:38,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-12 15:37:38,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:37:38,618 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-12 15:37:38,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:37:38,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1854795098, now seen corresponding path program 4 times [2024-11-12 15:37:38,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:37:38,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904776660] [2024-11-12 15:37:38,620 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 15:37:38,620 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-11-12 15:37:38,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:37:38,623 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:37:38,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-12 15:37:39,083 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-12 15:37:39,083 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:37:39,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 15:37:39,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:37:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:37:39,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:37:40,723 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:37:40,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:37:40,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904776660] [2024-11-12 15:37:40,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904776660] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:37:40,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:37:40,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-12 15:37:40,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480454808] [2024-11-12 15:37:40,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:37:40,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-12 15:37:40,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:37:40,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-12 15:37:40,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-12 15:37:40,726 INFO L87 Difference]: Start difference. First operand 1122 states and 1345 transitions. Second operand has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 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-11-12 15:37:45,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:37:45,359 INFO L93 Difference]: Finished difference Result 1162 states and 1417 transitions. [2024-11-12 15:37:45,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-12 15:37:45,360 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 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 96 [2024-11-12 15:37:45,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:37:45,363 INFO L225 Difference]: With dead ends: 1162 [2024-11-12 15:37:45,363 INFO L226 Difference]: Without dead ends: 1158 [2024-11-12 15:37:45,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-12 15:37:45,365 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 33 mSDsluCounter, 20911 mSDsCounter, 0 mSdLazyCounter, 1947 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 21823 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-12 15:37:45,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 21823 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1947 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-12 15:37:45,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-12 15:37:45,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1156. [2024-11-12 15:37:45,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 789 states have (on average 1.7389100126742711) internal successors, (1372), 1148 states have internal predecessors, (1372), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-12 15:37:45,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1391 transitions. [2024-11-12 15:37:45,379 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1391 transitions. Word has length 96 [2024-11-12 15:37:45,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:37:45,379 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1391 transitions. [2024-11-12 15:37:45,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 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-11-12 15:37:45,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1391 transitions. [2024-11-12 15:37:45,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-12 15:37:45,381 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:37:45,381 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:37:45,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-11-12 15:37:45,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:37:45,581 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 524 more)] === [2024-11-12 15:37:45,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:37:45,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1000487770, now seen corresponding path program 5 times [2024-11-12 15:37:45,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:37:45,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320556692] [2024-11-12 15:37:45,583 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-12 15:37:45,583 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-11-12 15:37:45,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:37:45,584 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:37:45,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-12 15:37:46,701 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-12 15:37:46,702 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:37:46,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-12 15:37:46,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:37:46,734 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-11-12 15:37:46,836 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-12 15:37:46,836 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-11-12 15:37:46,867 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-11-12 15:37:46,939 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-11-12 15:37:47,850 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:37:47,851 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-11-12 15:37:47,893 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-11-12 15:37:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-12 15:37:47,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:37:48,210 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1962 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-12 15:37:48,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:37:48,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320556692] [2024-11-12 15:37:48,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320556692] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:37:48,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1262438128] [2024-11-12 15:37:48,215 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-12 15:37:48,215 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 15:37:48,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 15:37:48,218 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 15:37:48,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process