./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc 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_SAX_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 d619c50f205026415119876db06c9bf079f51316bee7c051af8e3a06a37e393d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:11:56,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:11:56,204 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:11:56,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:11:56,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:11:56,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:11:56,233 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:11:56,233 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:11:56,234 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:11:56,235 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:11:56,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:11:56,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:11:56,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:11:56,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:11:56,238 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:11:56,238 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:11:56,238 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:11:56,238 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:11:56,239 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:11:56,239 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:11:56,239 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:11:56,239 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:11:56,240 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:11:56,240 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:11:56,240 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:11:56,240 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:11:56,240 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:11:56,241 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:11:56,241 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:11:56,241 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:11:56,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:11:56,241 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:11:56,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:11:56,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:11:56,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:11:56,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:11:56,242 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:11:56,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:11:56,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:11:56,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:11:56,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:11:56,244 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:11:56,244 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 -> d619c50f205026415119876db06c9bf079f51316bee7c051af8e3a06a37e393d [2024-11-19 09:11:56,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:11:56,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:11:56,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:11:56,463 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:11:56,466 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:11:56,467 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i [2024-11-19 09:11:57,680 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:11:57,910 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:11:57,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i [2024-11-19 09:11:57,928 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acf6b864b/5e95b2f285944238ab48a7a300de2f40/FLAGf6e912927 [2024-11-19 09:11:58,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acf6b864b/5e95b2f285944238ab48a7a300de2f40 [2024-11-19 09:11:58,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:11:58,248 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:11:58,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:11:58,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:11:58,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:11:58,254 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:11:58" (1/1) ... [2024-11-19 09:11:58,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b37f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:11:58, skipping insertion in model container [2024-11-19 09:11:58,255 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:11:58" (1/1) ... [2024-11-19 09:11:58,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:11:58,636 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-19 09:11:58,683 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-19 09:11:58,688 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-19 09:11:58,694 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-19 09:11:58,720 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-19 09:11:58,744 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-19 09:11:58,745 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-19 09:11:58,746 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-19 09:11:58,748 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-19 09:11:58,749 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-19 09:11:58,752 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-19 09:11:58,756 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-19 09:11:58,757 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-19 09:11:58,757 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-19 09:11:58,761 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-19 09:11:58,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:11:58,781 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-19 09:11:58,782 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5e3b48c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:11:58, skipping insertion in model container [2024-11-19 09:11:58,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:11:58,783 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 09:11:58,785 INFO L158 Benchmark]: Toolchain (without parser) took 535.95ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 77.5MB in the beginning and 162.3MB in the end (delta: -84.8MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2024-11-19 09:11:58,785 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 151.0MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:11:58,786 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.08ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 77.4MB in the beginning and 162.3MB in the end (delta: -85.0MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2024-11-19 09:11:58,787 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.14ms. Allocated memory is still 151.0MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 534.08ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 77.4MB in the beginning and 162.3MB in the end (delta: -85.0MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 833]: 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_SAX_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 d619c50f205026415119876db06c9bf079f51316bee7c051af8e3a06a37e393d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:12:00,309 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:12:00,370 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:12:00,376 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:12:00,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:12:00,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:12:00,402 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:12:00,403 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:12:00,403 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:12:00,404 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:12:00,405 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:12:00,405 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:12:00,405 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:12:00,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:12:00,406 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:12:00,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:12:00,408 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:12:00,408 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:12:00,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:12:00,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:12:00,409 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:12:00,409 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:12:00,410 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:12:00,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:12:00,410 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:12:00,411 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:12:00,411 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:12:00,411 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:12:00,411 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:12:00,411 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:12:00,411 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:12:00,412 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:12:00,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:12:00,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:12:00,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:12:00,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:12:00,413 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:12:00,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:12:00,413 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:12:00,413 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:12:00,413 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:12:00,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:12:00,414 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:12:00,414 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:12:00,414 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 -> d619c50f205026415119876db06c9bf079f51316bee7c051af8e3a06a37e393d [2024-11-19 09:12:00,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:12:00,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:12:00,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:12:00,693 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:12:00,693 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:12:00,695 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i [2024-11-19 09:12:01,941 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:12:02,213 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:12:02,214 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i [2024-11-19 09:12:02,231 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c78af501/c0316b4cc3484096941b29ee25999dd2/FLAG40c12e59e [2024-11-19 09:12:02,500 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c78af501/c0316b4cc3484096941b29ee25999dd2 [2024-11-19 09:12:02,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:12:02,503 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:12:02,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:12:02,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:12:02,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:12:02,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:12:02" (1/1) ... [2024-11-19 09:12:02,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e514443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:02, skipping insertion in model container [2024-11-19 09:12:02,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:12:02" (1/1) ... [2024-11-19 09:12:02,552 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:12:02,934 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-19 09:12:02,966 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-19 09:12:02,969 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-19 09:12:02,974 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-19 09:12:02,981 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-19 09:12:03,014 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-19 09:12:03,016 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-19 09:12:03,018 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-19 09:12:03,020 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-19 09:12:03,022 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-19 09:12:03,023 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-19 09:12:03,027 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-19 09:12:03,027 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-19 09:12:03,030 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-19 09:12:03,033 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-19 09:12:03,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:12:03,047 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 09:12:03,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:12:03,084 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-19 09:12:03,100 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-19 09:12:03,104 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-19 09:12:03,106 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-19 09:12:03,108 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-19 09:12:03,125 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-19 09:12:03,126 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-19 09:12:03,127 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-19 09:12:03,127 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-19 09:12:03,128 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-19 09:12:03,129 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-19 09:12:03,129 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-19 09:12:03,130 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-19 09:12:03,130 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-19 09:12:03,132 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-19 09:12:03,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:12:03,137 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:12:03,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:12:03,252 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:12:03,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:03 WrapperNode [2024-11-19 09:12:03,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:12:03,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:12:03,253 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:12:03,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:12:03,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:03" (1/1) ... [2024-11-19 09:12:03,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:03" (1/1) ... [2024-11-19 09:12:03,341 INFO L138 Inliner]: procedures = 211, calls = 280, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1082 [2024-11-19 09:12:03,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:12:03,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:12:03,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:12:03,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:12:03,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:03" (1/1) ... [2024-11-19 09:12:03,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:03" (1/1) ... [2024-11-19 09:12:03,377 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:03" (1/1) ... [2024-11-19 09:12:03,463 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 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-19 09:12:03,464 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:03" (1/1) ... [2024-11-19 09:12:03,464 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:03" (1/1) ... [2024-11-19 09:12:03,502 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:03" (1/1) ... [2024-11-19 09:12:03,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:03" (1/1) ... [2024-11-19 09:12:03,513 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:03" (1/1) ... [2024-11-19 09:12:03,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:03" (1/1) ... [2024-11-19 09:12:03,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:12:03,523 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:12:03,523 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:12:03,523 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:12:03,524 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:03" (1/1) ... [2024-11-19 09:12:03,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:12:03,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:12:03,557 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-19 09:12:03,560 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-19 09:12:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-19 09:12:03,595 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-19 09:12:03,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 09:12:03,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 09:12:03,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 09:12:03,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 09:12:03,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 09:12:03,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 09:12:03,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 09:12:03,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 09:12:03,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 09:12:03,597 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 09:12:03,597 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 09:12:03,597 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 09:12:03,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 09:12:03,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 09:12:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 09:12:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 09:12:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 09:12:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 09:12:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 09:12:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 09:12:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:12:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 09:12:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 09:12:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 09:12:03,599 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 09:12:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:12:03,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:12:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:12:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:12:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 09:12:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:12:03,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:12:03,787 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:12:03,789 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:12:03,804 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:12:03,835 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:12:03,854 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:12:06,245 INFO L? ?]: Removed 1101 outVars from TransFormulas that were not future-live. [2024-11-19 09:12:06,245 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:12:06,268 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:12:06,268 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-19 09:12:06,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:12:06 BoogieIcfgContainer [2024-11-19 09:12:06,268 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:12:06,270 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:12:06,270 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:12:06,275 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:12:06,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:12:02" (1/3) ... [2024-11-19 09:12:06,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3cbbb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:12:06, skipping insertion in model container [2024-11-19 09:12:06,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:03" (2/3) ... [2024-11-19 09:12:06,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3cbbb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:12:06, skipping insertion in model container [2024-11-19 09:12:06,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:12:06" (3/3) ... [2024-11-19 09:12:06,277 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test2-2.i [2024-11-19 09:12:06,288 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:12:06,289 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 529 error locations. [2024-11-19 09:12:06,348 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:12:06,354 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;@73f75929, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:12:06,354 INFO L334 AbstractCegarLoop]: Starting to check reachability of 529 error locations. [2024-11-19 09:12:06,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 1083 states, 543 states have (on average 2.2099447513812156) internal successors, (1200), 1076 states have internal predecessors, (1200), 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-19 09:12:06,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 09:12:06,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:12:06,363 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 09:12:06,363 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 09:12:06,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:12:06,367 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2024-11-19 09:12:06,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:12:06,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344425604] [2024-11-19 09:12:06,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:12:06,377 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-19 09:12:06,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:12:06,380 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-19 09:12:06,381 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-19 09:12:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:12:06,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:12:06,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:12:06,521 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-19 09:12:06,530 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-19 09:12:06,530 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:12:06,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:12:06,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344425604] [2024-11-19 09:12:06,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344425604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:12:06,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:12:06,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:12:06,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789781210] [2024-11-19 09:12:06,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:12:06,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:12:06,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:12:06,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:12:06,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:12:06,565 INFO L87 Difference]: Start difference. First operand has 1083 states, 543 states have (on average 2.2099447513812156) internal successors, (1200), 1076 states have internal predecessors, (1200), 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-19 09:12:07,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:12:07,717 INFO L93 Difference]: Finished difference Result 1248 states and 1325 transitions. [2024-11-19 09:12:07,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:12:07,719 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-19 09:12:07,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:12:07,733 INFO L225 Difference]: With dead ends: 1248 [2024-11-19 09:12:07,733 INFO L226 Difference]: Without dead ends: 1246 [2024-11-19 09:12:07,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:12:07,737 INFO L432 NwaCegarLoop]: 660 mSDtfsCounter, 983 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:12:07,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 816 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 09:12:07,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2024-11-19 09:12:07,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1067. [2024-11-19 09:12:07,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 545 states have (on average 2.0495412844036696) internal successors, (1117), 1060 states have internal predecessors, (1117), 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-19 09:12:07,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1135 transitions. [2024-11-19 09:12:07,820 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1135 transitions. Word has length 3 [2024-11-19 09:12:07,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:12:07,820 INFO L471 AbstractCegarLoop]: Abstraction has 1067 states and 1135 transitions. [2024-11-19 09:12:07,820 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-19 09:12:07,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1135 transitions. [2024-11-19 09:12:07,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 09:12:07,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:12:07,821 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 09:12:07,825 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-19 09:12:08,022 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-19 09:12:08,023 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 09:12:08,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:12:08,024 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2024-11-19 09:12:08,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:12:08,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94513073] [2024-11-19 09:12:08,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:12:08,024 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:12:08,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:12:08,027 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-19 09:12:08,028 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-19 09:12:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:12:08,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:12:08,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:12:08,121 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-19 09:12:08,129 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-19 09:12:08,129 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:12:08,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:12:08,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94513073] [2024-11-19 09:12:08,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94513073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:12:08,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:12:08,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:12:08,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154037280] [2024-11-19 09:12:08,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:12:08,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:12:08,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:12:08,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:12:08,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:12:08,132 INFO L87 Difference]: Start difference. First operand 1067 states and 1135 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-19 09:12:09,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:12:09,657 INFO L93 Difference]: Finished difference Result 1494 states and 1605 transitions. [2024-11-19 09:12:09,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:12:09,658 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-19 09:12:09,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:12:09,663 INFO L225 Difference]: With dead ends: 1494 [2024-11-19 09:12:09,663 INFO L226 Difference]: Without dead ends: 1494 [2024-11-19 09:12:09,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:12:09,665 INFO L432 NwaCegarLoop]: 933 mSDtfsCounter, 459 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:12:09,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1535 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 09:12:09,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2024-11-19 09:12:09,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1205. [2024-11-19 09:12:09,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 679 states have (on average 2.007363770250368) internal successors, (1363), 1198 states have internal predecessors, (1363), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:12:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1391 transitions. [2024-11-19 09:12:09,683 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1391 transitions. Word has length 3 [2024-11-19 09:12:09,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:12:09,684 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1391 transitions. [2024-11-19 09:12:09,684 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-19 09:12:09,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1391 transitions. [2024-11-19 09:12:09,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 09:12:09,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:12:09,684 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:12:09,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 (3)] Ended with exit code 0 [2024-11-19 09:12:09,885 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-19 09:12:09,885 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 09:12:09,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:12:09,886 INFO L85 PathProgramCache]: Analyzing trace with hash 458521935, now seen corresponding path program 1 times [2024-11-19 09:12:09,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:12:09,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350703360] [2024-11-19 09:12:09,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:12:09,886 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-19 09:12:09,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:12:09,889 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-19 09:12:09,890 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-19 09:12:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:12:09,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:12:09,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:12:09,999 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-19 09:12:10,005 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-19 09:12:10,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:12:10,060 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-19 09:12:10,073 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:12:10,073 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-19 09:12:10,094 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-19 09:12:10,095 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:12:10,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:12:10,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350703360] [2024-11-19 09:12:10,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350703360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:12:10,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:12:10,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:12:10,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755776468] [2024-11-19 09:12:10,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:12:10,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:12:10,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:12:10,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:12:10,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:12:10,098 INFO L87 Difference]: Start difference. First operand 1205 states and 1391 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-19 09:12:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:12:11,900 INFO L93 Difference]: Finished difference Result 1373 states and 1567 transitions. [2024-11-19 09:12:11,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:12:11,900 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-19 09:12:11,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:12:11,903 INFO L225 Difference]: With dead ends: 1373 [2024-11-19 09:12:11,903 INFO L226 Difference]: Without dead ends: 1373 [2024-11-19 09:12:11,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:12:11,904 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 2241 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2249 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 09:12:11,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2249 Valid, 480 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 09:12:11,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2024-11-19 09:12:11,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1055. [2024-11-19 09:12:11,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 545 states have (on average 2.0256880733944955) internal successors, (1104), 1048 states have internal predecessors, (1104), 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-19 09:12:11,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1122 transitions. [2024-11-19 09:12:11,919 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1122 transitions. Word has length 7 [2024-11-19 09:12:11,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:12:11,919 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1122 transitions. [2024-11-19 09:12:11,920 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-19 09:12:11,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1122 transitions. [2024-11-19 09:12:11,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 09:12:11,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:12:11,920 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:12:11,925 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-19 09:12:12,120 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-19 09:12:12,121 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 09:12:12,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:12:12,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278099, now seen corresponding path program 1 times [2024-11-19 09:12:12,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:12:12,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162639296] [2024-11-19 09:12:12,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:12:12,122 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-19 09:12:12,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:12:12,125 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-19 09:12:12,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 09:12:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:12:12,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:12:12,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:12:12,239 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-19 09:12:12,261 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-19 09:12:12,262 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:12:12,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:12:12,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162639296] [2024-11-19 09:12:12,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [162639296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:12:12,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:12:12,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:12:12,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941892530] [2024-11-19 09:12:12,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:12:12,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:12:12,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:12:12,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:12:12,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:12:12,264 INFO L87 Difference]: Start difference. First operand 1055 states and 1122 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-19 09:12:13,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:12:13,763 INFO L93 Difference]: Finished difference Result 1358 states and 1464 transitions. [2024-11-19 09:12:13,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:12:13,764 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-19 09:12:13,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:12:13,767 INFO L225 Difference]: With dead ends: 1358 [2024-11-19 09:12:13,767 INFO L226 Difference]: Without dead ends: 1358 [2024-11-19 09:12:13,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:12:13,768 INFO L432 NwaCegarLoop]: 1129 mSDtfsCounter, 515 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:12:13,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1577 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 09:12:13,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2024-11-19 09:12:13,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1082. [2024-11-19 09:12:13,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 582 states have (on average 2.013745704467354) internal successors, (1172), 1075 states have internal predecessors, (1172), 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-19 09:12:13,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1190 transitions. [2024-11-19 09:12:13,782 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1190 transitions. Word has length 8 [2024-11-19 09:12:13,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:12:13,782 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1190 transitions. [2024-11-19 09:12:13,782 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-19 09:12:13,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1190 transitions. [2024-11-19 09:12:13,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 09:12:13,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:12:13,783 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:12:13,786 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-19 09:12:13,985 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-19 09:12:13,985 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 09:12:13,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:12:13,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278098, now seen corresponding path program 1 times [2024-11-19 09:12:13,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:12:13,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842058867] [2024-11-19 09:12:13,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:12:13,986 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-19 09:12:13,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:12:13,987 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-19 09:12:13,989 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-19 09:12:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:12:14,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:12:14,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:12:14,075 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-19 09:12:14,081 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-19 09:12:14,082 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:12:14,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:12:14,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1842058867] [2024-11-19 09:12:14,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1842058867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:12:14,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:12:14,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:12:14,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882777074] [2024-11-19 09:12:14,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:12:14,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:12:14,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:12:14,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:12:14,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:12:14,083 INFO L87 Difference]: Start difference. First operand 1082 states and 1190 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-19 09:12:15,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:12:15,032 INFO L93 Difference]: Finished difference Result 1262 states and 1398 transitions. [2024-11-19 09:12:15,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:12:15,033 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-19 09:12:15,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:12:15,036 INFO L225 Difference]: With dead ends: 1262 [2024-11-19 09:12:15,036 INFO L226 Difference]: Without dead ends: 1262 [2024-11-19 09:12:15,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:12:15,036 INFO L432 NwaCegarLoop]: 919 mSDtfsCounter, 764 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 09:12:15,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1198 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 09:12:15,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2024-11-19 09:12:15,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1035. [2024-11-19 09:12:15,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 582 states have (on average 1.9261168384879725) internal successors, (1121), 1028 states have internal predecessors, (1121), 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-19 09:12:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1139 transitions. [2024-11-19 09:12:15,049 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1139 transitions. Word has length 8 [2024-11-19 09:12:15,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:12:15,050 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1139 transitions. [2024-11-19 09:12:15,050 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-19 09:12:15,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1139 transitions. [2024-11-19 09:12:15,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 09:12:15,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:12:15,050 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:12:15,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-19 09:12:15,251 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-19 09:12:15,251 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 09:12:15,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:12:15,252 INFO L85 PathProgramCache]: Analyzing trace with hash -285815487, now seen corresponding path program 1 times [2024-11-19 09:12:15,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:12:15,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975738864] [2024-11-19 09:12:15,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:12:15,252 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-19 09:12:15,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:12:15,253 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-19 09:12:15,254 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-19 09:12:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:12:15,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:12:15,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:12:15,384 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-19 09:12:15,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:12:15,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:12:15,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975738864] [2024-11-19 09:12:15,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975738864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:12:15,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:12:15,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:12:15,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573615755] [2024-11-19 09:12:15,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:12:15,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:12:15,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:12:15,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:12:15,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:12:15,386 INFO L87 Difference]: Start difference. First operand 1035 states and 1139 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:12:15,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:12:15,552 INFO L93 Difference]: Finished difference Result 1490 states and 1660 transitions. [2024-11-19 09:12:15,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:12:15,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-19 09:12:15,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:12:15,556 INFO L225 Difference]: With dead ends: 1490 [2024-11-19 09:12:15,556 INFO L226 Difference]: Without dead ends: 1490 [2024-11-19 09:12:15,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-19 09:12:15,558 INFO L432 NwaCegarLoop]: 1125 mSDtfsCounter, 481 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 2098 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:12:15,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 2098 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 09:12:15,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2024-11-19 09:12:15,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1222. [2024-11-19 09:12:15,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 764 states have (on average 1.8730366492146597) internal successors, (1431), 1215 states have internal predecessors, (1431), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:12:15,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1459 transitions. [2024-11-19 09:12:15,580 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1459 transitions. Word has length 11 [2024-11-19 09:12:15,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:12:15,581 INFO L471 AbstractCegarLoop]: Abstraction has 1222 states and 1459 transitions. [2024-11-19 09:12:15,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:12:15,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1459 transitions. [2024-11-19 09:12:15,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 09:12:15,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:12:15,582 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:12:15,585 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-19 09:12:15,782 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-19 09:12:15,783 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 09:12:15,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:12:15,784 INFO L85 PathProgramCache]: Analyzing trace with hash -170511720, now seen corresponding path program 1 times [2024-11-19 09:12:15,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:12:15,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239123067] [2024-11-19 09:12:15,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:12:15,784 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-19 09:12:15,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:12:15,786 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-19 09:12:15,787 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-19 09:12:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:12:15,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:12:15,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:12:15,895 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-19 09:12:15,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:12:15,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:12:15,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239123067] [2024-11-19 09:12:15,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239123067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:12:15,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:12:15,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:12:15,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527689285] [2024-11-19 09:12:15,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:12:15,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:12:15,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:12:15,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:12:15,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:12:15,896 INFO L87 Difference]: Start difference. First operand 1222 states and 1459 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:12:15,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:12:15,922 INFO L93 Difference]: Finished difference Result 1162 states and 1373 transitions. [2024-11-19 09:12:15,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:12:15,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-19 09:12:15,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:12:15,925 INFO L225 Difference]: With dead ends: 1162 [2024-11-19 09:12:15,925 INFO L226 Difference]: Without dead ends: 1162 [2024-11-19 09:12:15,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:12:15,926 INFO L432 NwaCegarLoop]: 1002 mSDtfsCounter, 71 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1941 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-19 09:12:15,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1941 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:12:15,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2024-11-19 09:12:15,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1162. [2024-11-19 09:12:15,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 728 states have (on average 1.8475274725274726) internal successors, (1345), 1155 states have internal predecessors, (1345), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:12:15,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1373 transitions. [2024-11-19 09:12:15,942 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1373 transitions. Word has length 13 [2024-11-19 09:12:15,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:12:15,942 INFO L471 AbstractCegarLoop]: Abstraction has 1162 states and 1373 transitions. [2024-11-19 09:12:15,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:12:15,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1373 transitions. [2024-11-19 09:12:15,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 09:12:15,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:12:15,943 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:12:15,946 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-19 09:12:16,144 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-19 09:12:16,144 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr424REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 09:12:16,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:12:16,145 INFO L85 PathProgramCache]: Analyzing trace with hash -2096841630, now seen corresponding path program 1 times [2024-11-19 09:12:16,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:12:16,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212633268] [2024-11-19 09:12:16,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:12:16,145 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-19 09:12:16,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:12:16,146 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-19 09:12:16,147 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-19 09:12:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:12:16,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:12:16,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:12:16,297 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-19 09:12:16,298 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:12:16,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:12:16,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212633268] [2024-11-19 09:12:16,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212633268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:12:16,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:12:16,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:12:16,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042937964] [2024-11-19 09:12:16,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:12:16,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:12:16,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:12:16,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:12:16,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:12:16,299 INFO L87 Difference]: Start difference. First operand 1162 states and 1373 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:12:16,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:12:16,676 INFO L93 Difference]: Finished difference Result 1408 states and 1576 transitions. [2024-11-19 09:12:16,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:12:16,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-19 09:12:16,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:12:16,679 INFO L225 Difference]: With dead ends: 1408 [2024-11-19 09:12:16,679 INFO L226 Difference]: Without dead ends: 1408 [2024-11-19 09:12:16,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:12:16,680 INFO L432 NwaCegarLoop]: 1081 mSDtfsCounter, 441 mSDsluCounter, 1905 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 2986 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:12:16,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 2986 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 09:12:16,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2024-11-19 09:12:16,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1164. [2024-11-19 09:12:16,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 730 states have (on average 1.8452054794520547) internal successors, (1347), 1157 states have internal predecessors, (1347), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:12:16,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1375 transitions. [2024-11-19 09:12:16,703 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1375 transitions. Word has length 14 [2024-11-19 09:12:16,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:12:16,704 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1375 transitions. [2024-11-19 09:12:16,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:12:16,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1375 transitions. [2024-11-19 09:12:16,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 09:12:16,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:12:16,705 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:12:16,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 (9)] Ended with exit code 0 [2024-11-19 09:12:16,905 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-19 09:12:16,905 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr527ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 09:12:16,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:12:16,906 INFO L85 PathProgramCache]: Analyzing trace with hash -2096834720, now seen corresponding path program 1 times [2024-11-19 09:12:16,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:12:16,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71523549] [2024-11-19 09:12:16,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:12:16,906 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-19 09:12:16,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:12:16,908 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-19 09:12:16,909 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-19 09:12:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:12:17,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:12:17,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:12:17,024 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:12:17,025 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:12:17,025 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:12:17,029 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-19 09:12:17,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:12:17,075 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-19 09:12:17,086 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-19 09:12:17,086 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:12:17,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:12:17,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71523549] [2024-11-19 09:12:17,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [71523549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:12:17,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:12:17,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:12:17,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220465021] [2024-11-19 09:12:17,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:12:17,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:12:17,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:12:17,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:12:17,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:12:17,087 INFO L87 Difference]: Start difference. First operand 1164 states and 1375 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:12:17,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:12:17,276 INFO L93 Difference]: Finished difference Result 1994 states and 2228 transitions. [2024-11-19 09:12:17,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:12:17,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-19 09:12:17,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:12:17,281 INFO L225 Difference]: With dead ends: 1994 [2024-11-19 09:12:17,282 INFO L226 Difference]: Without dead ends: 1994 [2024-11-19 09:12:17,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:12:17,283 INFO L432 NwaCegarLoop]: 1206 mSDtfsCounter, 934 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 3387 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:12:17,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 3387 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 09:12:17,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2024-11-19 09:12:17,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1163. [2024-11-19 09:12:17,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 729 states have (on average 1.8449931412894376) internal successors, (1345), 1156 states have internal predecessors, (1345), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:12:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1373 transitions. [2024-11-19 09:12:17,299 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1373 transitions. Word has length 14 [2024-11-19 09:12:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:12:17,299 INFO L471 AbstractCegarLoop]: Abstraction has 1163 states and 1373 transitions. [2024-11-19 09:12:17,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:12:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1373 transitions. [2024-11-19 09:12:17,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 09:12:17,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:12:17,300 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:12:17,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-19 09:12:17,500 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-19 09:12:17,501 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 09:12:17,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:12:17,501 INFO L85 PathProgramCache]: Analyzing trace with hash 183846334, now seen corresponding path program 1 times [2024-11-19 09:12:17,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:12:17,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502964063] [2024-11-19 09:12:17,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:12:17,501 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-19 09:12:17,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:12:17,504 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-19 09:12:17,504 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-19 09:12:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:12:17,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:12:17,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:12:17,623 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-19 09:12:17,623 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:12:17,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:12:17,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502964063] [2024-11-19 09:12:17,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502964063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:12:17,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:12:17,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:12:17,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455805708] [2024-11-19 09:12:17,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:12:17,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:12:17,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:12:17,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:12:17,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:12:17,624 INFO L87 Difference]: Start difference. First operand 1163 states and 1373 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-19 09:12:17,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:12:17,647 INFO L93 Difference]: Finished difference Result 1103 states and 1287 transitions. [2024-11-19 09:12:17,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:12:17,650 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-19 09:12:17,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:12:17,653 INFO L225 Difference]: With dead ends: 1103 [2024-11-19 09:12:17,653 INFO L226 Difference]: Without dead ends: 1103 [2024-11-19 09:12:17,653 INFO L431 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-19 09:12:17,653 INFO L432 NwaCegarLoop]: 959 mSDtfsCounter, 71 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1855 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-19 09:12:17,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1855 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:12:17,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2024-11-19 09:12:17,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1103. [2024-11-19 09:12:17,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 693 states have (on average 1.8167388167388168) internal successors, (1259), 1096 states have internal predecessors, (1259), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:12:17,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1287 transitions. [2024-11-19 09:12:17,666 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1287 transitions. Word has length 18 [2024-11-19 09:12:17,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:12:17,666 INFO L471 AbstractCegarLoop]: Abstraction has 1103 states and 1287 transitions. [2024-11-19 09:12:17,667 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-19 09:12:17,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1287 transitions. [2024-11-19 09:12:17,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 09:12:17,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:12:17,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:12:17,673 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-19 09:12:17,868 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-19 09:12:17,869 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 09:12:17,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:12:17,869 INFO L85 PathProgramCache]: Analyzing trace with hash 582665080, now seen corresponding path program 1 times [2024-11-19 09:12:17,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:12:17,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778939154] [2024-11-19 09:12:17,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:12:17,869 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-19 09:12:17,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:12:17,872 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-19 09:12:17,872 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-19 09:12:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:12:17,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:12:17,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:12:17,999 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-19 09:12:17,999 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:12:17,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:12:17,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778939154] [2024-11-19 09:12:17,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778939154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:12:17,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:12:17,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:12:18,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619091723] [2024-11-19 09:12:18,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:12:18,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:12:18,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:12:18,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:12:18,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:12:18,000 INFO L87 Difference]: Start difference. First operand 1103 states and 1287 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-19 09:12:18,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:12:18,052 INFO L93 Difference]: Finished difference Result 1073 states and 1229 transitions. [2024-11-19 09:12:18,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:12:18,053 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-19 09:12:18,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:12:18,055 INFO L225 Difference]: With dead ends: 1073 [2024-11-19 09:12:18,055 INFO L226 Difference]: Without dead ends: 1073 [2024-11-19 09:12:18,055 INFO L431 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-19 09:12:18,055 INFO L432 NwaCegarLoop]: 914 mSDtfsCounter, 48 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2716 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-19 09:12:18,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2716 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:12:18,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2024-11-19 09:12:18,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1073. [2024-11-19 09:12:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1073 states, 677 states have (on average 1.7740029542097489) internal successors, (1201), 1066 states have internal predecessors, (1201), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:12:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1229 transitions. [2024-11-19 09:12:18,069 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1229 transitions. Word has length 20 [2024-11-19 09:12:18,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:12:18,070 INFO L471 AbstractCegarLoop]: Abstraction has 1073 states and 1229 transitions. [2024-11-19 09:12:18,070 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-19 09:12:18,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1229 transitions. [2024-11-19 09:12:18,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 09:12:18,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:12:18,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:12:18,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-19 09:12:18,271 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-19 09:12:18,271 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 09:12:18,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:12:18,271 INFO L85 PathProgramCache]: Analyzing trace with hash -195006074, now seen corresponding path program 1 times [2024-11-19 09:12:18,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:12:18,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513263085] [2024-11-19 09:12:18,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:12:18,272 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-19 09:12:18,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:12:18,274 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-19 09:12:18,275 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-19 09:12:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:12:18,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:12:18,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:12:18,396 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-19 09:12:18,454 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-19 09:12:18,455 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:12:18,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:12:18,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513263085] [2024-11-19 09:12:18,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [513263085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:12:18,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:12:18,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:12:18,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538119686] [2024-11-19 09:12:18,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:12:18,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:12:18,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:12:18,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:12:18,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:12:18,456 INFO L87 Difference]: Start difference. First operand 1073 states and 1229 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-19 09:12:19,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:12:19,544 INFO L93 Difference]: Finished difference Result 1077 states and 1229 transitions. [2024-11-19 09:12:19,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:12:19,544 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-19 09:12:19,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:12:19,547 INFO L225 Difference]: With dead ends: 1077 [2024-11-19 09:12:19,547 INFO L226 Difference]: Without dead ends: 1077 [2024-11-19 09:12:19,547 INFO L431 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-19 09:12:19,547 INFO L432 NwaCegarLoop]: 600 mSDtfsCounter, 654 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:12:19,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 1154 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 09:12:19,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2024-11-19 09:12:19,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1069. [2024-11-19 09:12:19,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 677 states have (on average 1.7621861152141802) internal successors, (1193), 1062 states have internal predecessors, (1193), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:12:19,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1221 transitions. [2024-11-19 09:12:19,558 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1221 transitions. Word has length 34 [2024-11-19 09:12:19,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:12:19,558 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1221 transitions. [2024-11-19 09:12:19,558 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-19 09:12:19,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1221 transitions. [2024-11-19 09:12:19,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 09:12:19,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:12:19,559 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:12:19,563 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-19 09:12:19,761 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-19 09:12:19,761 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 09:12:19,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:12:19,761 INFO L85 PathProgramCache]: Analyzing trace with hash -195006073, now seen corresponding path program 1 times [2024-11-19 09:12:19,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:12:19,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318006712] [2024-11-19 09:12:19,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:12:19,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:12:19,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:12:19,764 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-19 09:12:19,765 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-19 09:12:19,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:12:19,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:12:19,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:12:19,904 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-19 09:12:20,020 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-19 09:12:20,020 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:12:20,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:12:20,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318006712] [2024-11-19 09:12:20,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318006712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:12:20,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:12:20,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:12:20,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334554674] [2024-11-19 09:12:20,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:12:20,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:12:20,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:12:20,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:12:20,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:12:20,022 INFO L87 Difference]: Start difference. First operand 1069 states and 1221 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-19 09:12:21,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:12:21,602 INFO L93 Difference]: Finished difference Result 1388 states and 1582 transitions. [2024-11-19 09:12:21,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:12:21,602 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-19 09:12:21,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:12:21,605 INFO L225 Difference]: With dead ends: 1388 [2024-11-19 09:12:21,606 INFO L226 Difference]: Without dead ends: 1388 [2024-11-19 09:12:21,606 INFO L431 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-19 09:12:21,606 INFO L432 NwaCegarLoop]: 1079 mSDtfsCounter, 401 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:12:21,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 2157 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 09:12:21,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-11-19 09:12:21,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1065. [2024-11-19 09:12:21,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 677 states have (on average 1.7503692762186116) internal successors, (1185), 1058 states have internal predecessors, (1185), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:12:21,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1213 transitions. [2024-11-19 09:12:21,619 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1213 transitions. Word has length 34 [2024-11-19 09:12:21,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:12:21,619 INFO L471 AbstractCegarLoop]: Abstraction has 1065 states and 1213 transitions. [2024-11-19 09:12:21,619 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-19 09:12:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1213 transitions. [2024-11-19 09:12:21,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-19 09:12:21,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:12:21,620 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:12:21,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-19 09:12:21,821 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-19 09:12:21,821 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 09:12:21,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:12:21,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1181697534, now seen corresponding path program 1 times [2024-11-19 09:12:21,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:12:21,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508520964] [2024-11-19 09:12:21,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:12:21,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:12:21,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:12:21,825 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-19 09:12:21,826 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-19 09:12:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:12:21,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:12:21,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:12:22,022 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-19 09:12:22,023 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:12:22,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:12:22,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508520964] [2024-11-19 09:12:22,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508520964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:12:22,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:12:22,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:12:22,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109441607] [2024-11-19 09:12:22,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:12:22,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:12:22,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:12:22,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:12:22,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:12:22,024 INFO L87 Difference]: Start difference. First operand 1065 states and 1213 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-19 09:12:22,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:12:22,063 INFO L93 Difference]: Finished difference Result 1053 states and 1193 transitions. [2024-11-19 09:12:22,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:12:22,063 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-19 09:12:22,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:12:22,066 INFO L225 Difference]: With dead ends: 1053 [2024-11-19 09:12:22,066 INFO L226 Difference]: Without dead ends: 1053 [2024-11-19 09:12:22,066 INFO L431 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-19 09:12:22,066 INFO L432 NwaCegarLoop]: 908 mSDtfsCounter, 21 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2693 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-19 09:12:22,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2693 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:12:22,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2024-11-19 09:12:22,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1053. [2024-11-19 09:12:22,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 665 states have (on average 1.7518796992481203) internal successors, (1165), 1046 states have internal predecessors, (1165), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:12:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1193 transitions. [2024-11-19 09:12:22,088 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1193 transitions. Word has length 53 [2024-11-19 09:12:22,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:12:22,088 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1193 transitions. [2024-11-19 09:12:22,088 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-19 09:12:22,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1193 transitions. [2024-11-19 09:12:22,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-19 09:12:22,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:12:22,091 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:12:22,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-19 09:12:22,291 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-19 09:12:22,292 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 09:12:22,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:12:22,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1740051530, now seen corresponding path program 1 times [2024-11-19 09:12:22,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:12:22,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071980399] [2024-11-19 09:12:22,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:12:22,294 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-19 09:12:22,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:12:22,297 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-19 09:12:22,298 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-19 09:12:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:12:22,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 09:12:22,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:12:22,578 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-19 09:12:22,583 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-19 09:12:22,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:12:22,942 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-19 09:12:22,952 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:12:22,952 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-19 09:12:22,960 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-19 09:12:22,960 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:12:22,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:12:22,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071980399] [2024-11-19 09:12:22,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071980399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:12:22,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:12:22,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:12:22,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094025876] [2024-11-19 09:12:22,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:12:22,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:12:22,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:12:22,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:12:22,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:12:22,962 INFO L87 Difference]: Start difference. First operand 1053 states and 1193 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-19 09:12:23,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:12:23,865 INFO L93 Difference]: Finished difference Result 1015 states and 1155 transitions. [2024-11-19 09:12:23,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:12:23,866 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-19 09:12:23,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:12:23,868 INFO L225 Difference]: With dead ends: 1015 [2024-11-19 09:12:23,868 INFO L226 Difference]: Without dead ends: 1015 [2024-11-19 09:12:23,868 INFO L431 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-19 09:12:23,869 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 1160 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 09:12:23,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 597 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 09:12:23,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2024-11-19 09:12:23,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 978. [2024-11-19 09:12:23,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 628 states have (on average 1.6767515923566878) internal successors, (1053), 971 states have internal predecessors, (1053), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:12:23,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1081 transitions. [2024-11-19 09:12:23,877 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1081 transitions. Word has length 61 [2024-11-19 09:12:23,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:12:23,877 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1081 transitions. [2024-11-19 09:12:23,877 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-19 09:12:23,877 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1081 transitions. [2024-11-19 09:12:23,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 09:12:23,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:12:23,878 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:12:23,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-19 09:12:24,078 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-19 09:12:24,078 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 09:12:24,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:12:24,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1654454369, now seen corresponding path program 1 times [2024-11-19 09:12:24,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:12:24,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100916072] [2024-11-19 09:12:24,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:12:24,079 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-19 09:12:24,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:12:24,081 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-19 09:12:24,081 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-19 09:12:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:12:24,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:12:24,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:12:24,279 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-19 09:12:24,289 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-19 09:12:24,303 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-19 09:12:24,309 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-19 09:12:24,309 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:12:24,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:12:24,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100916072] [2024-11-19 09:12:24,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100916072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:12:24,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:12:24,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:12:24,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452994342] [2024-11-19 09:12:24,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:12:24,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:12:24,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:12:24,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:12:24,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:12:24,310 INFO L87 Difference]: Start difference. First operand 978 states and 1081 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-19 09:12:25,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:12:25,525 INFO L93 Difference]: Finished difference Result 977 states and 1080 transitions. [2024-11-19 09:12:25,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:12:25,525 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-19 09:12:25,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:12:25,528 INFO L225 Difference]: With dead ends: 977 [2024-11-19 09:12:25,528 INFO L226 Difference]: Without dead ends: 977 [2024-11-19 09:12:25,528 INFO L431 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-19 09:12:25,528 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 2 mSDsluCounter, 1432 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2313 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:12:25,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2313 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 09:12:25,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-19 09:12:25,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2024-11-19 09:12:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 628 states have (on average 1.6751592356687899) internal successors, (1052), 970 states have internal predecessors, (1052), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:12:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1080 transitions. [2024-11-19 09:12:25,536 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1080 transitions. Word has length 66 [2024-11-19 09:12:25,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:12:25,536 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1080 transitions. [2024-11-19 09:12:25,536 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-19 09:12:25,537 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1080 transitions. [2024-11-19 09:12:25,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 09:12:25,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:12:25,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:12:25,544 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-19 09:12:25,737 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-19 09:12:25,738 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 09:12:25,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:12:25,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1654454368, now seen corresponding path program 1 times [2024-11-19 09:12:25,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:12:25,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1267609034] [2024-11-19 09:12:25,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:12:25,739 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-19 09:12:25,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:12:25,741 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-19 09:12:25,742 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-19 09:12:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:12:25,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 09:12:25,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:12:25,948 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-19 09:12:25,962 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-19 09:12:25,967 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-19 09:12:26,001 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-19 09:12:26,022 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-19 09:12:26,022 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:12:26,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:12:26,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1267609034] [2024-11-19 09:12:26,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1267609034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:12:26,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:12:26,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:12:26,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396412210] [2024-11-19 09:12:26,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:12:26,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:12:26,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:12:26,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:12:26,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:12:26,023 INFO L87 Difference]: Start difference. First operand 977 states and 1080 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-19 09:12:27,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:12:27,447 INFO L93 Difference]: Finished difference Result 976 states and 1079 transitions. [2024-11-19 09:12:27,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:12:27,448 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-19 09:12:27,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:12:27,450 INFO L225 Difference]: With dead ends: 976 [2024-11-19 09:12:27,450 INFO L226 Difference]: Without dead ends: 976 [2024-11-19 09:12:27,450 INFO L431 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-19 09:12:27,451 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 1 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2346 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:12:27,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2346 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 09:12:27,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-11-19 09:12:27,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2024-11-19 09:12:27,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 627 states have (on average 1.6762360446570972) internal successors, (1051), 969 states have internal predecessors, (1051), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:12:27,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1079 transitions. [2024-11-19 09:12:27,459 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1079 transitions. Word has length 66 [2024-11-19 09:12:27,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:12:27,460 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1079 transitions. [2024-11-19 09:12:27,460 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-19 09:12:27,461 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1079 transitions. [2024-11-19 09:12:27,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-19 09:12:27,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:12:27,461 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:12:27,468 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-19 09:12:27,661 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-19 09:12:27,663 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 09:12:27,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:12:27,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1278099258, now seen corresponding path program 1 times [2024-11-19 09:12:27,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:12:27,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616986780] [2024-11-19 09:12:27,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:12:27,664 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-19 09:12:27,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:12:27,665 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-19 09:12:27,666 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-19 09:12:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:12:27,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:12:27,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:12:27,893 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-19 09:12:27,893 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:12:27,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:12:27,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616986780] [2024-11-19 09:12:27,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [616986780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:12:27,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:12:27,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:12:27,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706334123] [2024-11-19 09:12:27,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:12:27,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:12:27,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:12:27,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:12:27,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:12:27,895 INFO L87 Difference]: Start difference. First operand 976 states and 1079 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-19 09:12:27,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:12:27,921 INFO L93 Difference]: Finished difference Result 979 states and 1083 transitions. [2024-11-19 09:12:27,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:12:27,922 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-19 09:12:27,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:12:27,925 INFO L225 Difference]: With dead ends: 979 [2024-11-19 09:12:27,925 INFO L226 Difference]: Without dead ends: 979 [2024-11-19 09:12:27,925 INFO L431 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-19 09:12:27,926 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 0 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2638 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-19 09:12:27,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2638 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:12:27,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2024-11-19 09:12:27,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 979. [2024-11-19 09:12:27,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 629 states have (on average 1.6756756756756757) internal successors, (1054), 972 states have internal predecessors, (1054), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 09:12:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1083 transitions. [2024-11-19 09:12:27,936 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1083 transitions. Word has length 74 [2024-11-19 09:12:27,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:12:27,937 INFO L471 AbstractCegarLoop]: Abstraction has 979 states and 1083 transitions. [2024-11-19 09:12:27,937 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-19 09:12:27,937 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1083 transitions. [2024-11-19 09:12:27,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-19 09:12:27,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:12:27,937 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:12:27,944 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-19 09:12:28,141 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-19 09:12:28,142 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 09:12:28,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:12:28,142 INFO L85 PathProgramCache]: Analyzing trace with hash -21075024, now seen corresponding path program 1 times [2024-11-19 09:12:28,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:12:28,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977995265] [2024-11-19 09:12:28,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:12:28,143 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-19 09:12:28,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:12:28,145 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-19 09:12:28,146 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-19 09:12:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:12:28,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:12:28,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:12:28,366 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-19 09:12:28,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:12:28,424 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-19 09:12:28,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:12:28,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977995265] [2024-11-19 09:12:28,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977995265] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:12:28,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:12:28,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 09:12:28,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082298076] [2024-11-19 09:12:28,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:12:28,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 09:12:28,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:12:28,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 09:12:28,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:12:28,426 INFO L87 Difference]: Start difference. First operand 979 states and 1083 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-19 09:12:28,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:12:28,515 INFO L93 Difference]: Finished difference Result 991 states and 1100 transitions. [2024-11-19 09:12:28,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:12:28,516 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-19 09:12:28,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:12:28,519 INFO L225 Difference]: With dead ends: 991 [2024-11-19 09:12:28,519 INFO L226 Difference]: Without dead ends: 991 [2024-11-19 09:12:28,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:12:28,519 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 5 mSDsluCounter, 2634 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3515 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:12:28,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3515 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:12:28,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2024-11-19 09:12:28,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 989. [2024-11-19 09:12:28,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 638 states have (on average 1.6755485893416928) internal successors, (1069), 981 states have internal predecessors, (1069), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 09:12:28,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1098 transitions. [2024-11-19 09:12:28,529 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1098 transitions. Word has length 75 [2024-11-19 09:12:28,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:12:28,529 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1098 transitions. [2024-11-19 09:12:28,529 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-19 09:12:28,529 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1098 transitions. [2024-11-19 09:12:28,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 09:12:28,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:12:28,529 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:12:28,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-19 09:12:28,730 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-19 09:12:28,730 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 09:12:28,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:12:28,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1595550534, now seen corresponding path program 2 times [2024-11-19 09:12:28,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:12:28,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189610315] [2024-11-19 09:12:28,731 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:12:28,731 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-19 09:12:28,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:12:28,732 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-19 09:12:28,733 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-19 09:12:29,066 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:12:29,066 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:12:29,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:12:29,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:12:29,113 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-19 09:12:29,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:12:29,209 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-19 09:12:29,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:12:29,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189610315] [2024-11-19 09:12:29,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189610315] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:12:29,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:12:29,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-19 09:12:29,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680936762] [2024-11-19 09:12:29,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:12:29,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:12:29,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:12:29,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:12:29,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-19 09:12:29,211 INFO L87 Difference]: Start difference. First operand 989 states and 1098 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-19 09:12:29,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:12:29,536 INFO L93 Difference]: Finished difference Result 1004 states and 1120 transitions. [2024-11-19 09:12:29,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 09:12:29,536 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-19 09:12:29,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:12:29,539 INFO L225 Difference]: With dead ends: 1004 [2024-11-19 09:12:29,539 INFO L226 Difference]: Without dead ends: 1000 [2024-11-19 09:12:29,539 INFO L431 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-19 09:12:29,540 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 13 mSDsluCounter, 7896 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 8777 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:12:29,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 8777 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 09:12:29,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2024-11-19 09:12:29,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 998. [2024-11-19 09:12:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 647 states have (on average 1.6707882534775889) internal successors, (1081), 990 states have internal predecessors, (1081), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 09:12:29,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1110 transitions. [2024-11-19 09:12:29,551 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1110 transitions. Word has length 78 [2024-11-19 09:12:29,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:12:29,551 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1110 transitions. [2024-11-19 09:12:29,551 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-19 09:12:29,551 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1110 transitions. [2024-11-19 09:12:29,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 09:12:29,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:12:29,552 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:12:29,560 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-19 09:12:29,752 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-19 09:12:29,753 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 09:12:29,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:12:29,753 INFO L85 PathProgramCache]: Analyzing trace with hash -382897402, now seen corresponding path program 3 times [2024-11-19 09:12:29,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:12:29,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450961018] [2024-11-19 09:12:29,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:12:29,754 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-19 09:12:29,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:12:29,755 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-19 09:12:29,756 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-19 09:12:30,249 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-19 09:12:30,250 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:12:30,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 09:12:30,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:12:30,349 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-19 09:12:30,349 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:12:30,699 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-19 09:12:30,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:12:30,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450961018] [2024-11-19 09:12:30,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450961018] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:12:30,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:12:30,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-19 09:12:30,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579010049] [2024-11-19 09:12:30,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:12:30,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 09:12:30,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:12:30,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 09:12:30,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-19 09:12:30,701 INFO L87 Difference]: Start difference. First operand 998 states and 1110 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-19 09:12:31,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:12:31,788 INFO L93 Difference]: Finished difference Result 1022 states and 1149 transitions. [2024-11-19 09:12:31,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-19 09:12:31,789 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-19 09:12:31,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:12:31,792 INFO L225 Difference]: With dead ends: 1022 [2024-11-19 09:12:31,792 INFO L226 Difference]: Without dead ends: 1016 [2024-11-19 09:12:31,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 09:12:31,793 INFO L432 NwaCegarLoop]: 882 mSDtfsCounter, 21 mSDsluCounter, 11423 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 12305 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:12:31,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 12305 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 09:12:31,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2024-11-19 09:12:31,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2024-11-19 09:12:31,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 665 states have (on average 1.6601503759398497) internal successors, (1104), 1008 states have internal predecessors, (1104), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 09:12:31,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1133 transitions. [2024-11-19 09:12:31,802 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1133 transitions. Word has length 84 [2024-11-19 09:12:31,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:12:31,802 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1133 transitions. [2024-11-19 09:12:31,803 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-19 09:12:31,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1133 transitions. [2024-11-19 09:12:31,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 09:12:31,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:12:31,803 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:12:31,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-19 09:12:32,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:12:32,004 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 09:12:32,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:12:32,005 INFO L85 PathProgramCache]: Analyzing trace with hash 516002438, now seen corresponding path program 4 times [2024-11-19 09:12:32,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:12:32,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108949367] [2024-11-19 09:12:32,006 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:12:32,006 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-19 09:12:32,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:12:32,008 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:12:32,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-19 09:12:32,400 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:12:32,400 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:12:32,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 09:12:32,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:12:32,676 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-19 09:12:32,677 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:12:33,611 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-19 09:12:33,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:12:33,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108949367] [2024-11-19 09:12:33,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108949367] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:12:33,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:12:33,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-19 09:12:33,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745187940] [2024-11-19 09:12:33,612 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:12:33,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-19 09:12:33,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:12:33,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-19 09:12:33,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 09:12:33,614 INFO L87 Difference]: Start difference. First operand 1016 states and 1133 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-19 09:12:37,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:12:37,468 INFO L93 Difference]: Finished difference Result 1056 states and 1205 transitions. [2024-11-19 09:12:37,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-19 09:12:37,469 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-19 09:12:37,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:12:37,471 INFO L225 Difference]: With dead ends: 1056 [2024-11-19 09:12:37,471 INFO L226 Difference]: Without dead ends: 1052 [2024-11-19 09:12:37,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-19 09:12:37,473 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 37 mSDsluCounter, 20197 mSDsCounter, 0 mSdLazyCounter, 1931 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 21078 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:12:37,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 21078 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1931 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 09:12:37,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2024-11-19 09:12:37,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1050. [2024-11-19 09:12:37,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 699 states have (on average 1.6452074391988556) internal successors, (1150), 1042 states have internal predecessors, (1150), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 09:12:37,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1179 transitions. [2024-11-19 09:12:37,483 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1179 transitions. Word has length 96 [2024-11-19 09:12:37,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:12:37,483 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1179 transitions. [2024-11-19 09:12:37,483 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-19 09:12:37,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1179 transitions. [2024-11-19 09:12:37,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 09:12:37,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:12:37,484 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:12:37,498 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 (23)] Ended with exit code 0 [2024-11-19 09:12:37,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:12:37,684 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 09:12:37,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:12:37,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1069651014, now seen corresponding path program 5 times [2024-11-19 09:12:37,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:12:37,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678170009] [2024-11-19 09:12:37,685 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:12:37,686 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-19 09:12:37,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:12:37,688 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:12:37,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-19 09:12:38,664 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-19 09:12:38,664 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:12:38,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-19 09:12:38,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:12:38,694 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-19 09:12:38,762 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-19 09:12:38,763 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-19 09:12:38,790 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-19 09:12:38,853 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-19 09:12:39,579 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:12:39,579 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-19 09:12:39,614 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-19 09:12:39,632 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-19 09:12:39,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:12:39,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:12:39,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678170009] [2024-11-19 09:12:39,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678170009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:12:39,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2132265656] [2024-11-19 09:12:39,876 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:12:39,876 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 09:12:39,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 09:12:39,877 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 09:12:39,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process