./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test15-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test15-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e94333448b9ec2a5ffed0adee00d968fb025c54e55196475ef51117fcee9fc3a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:27:32,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:27:32,525 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 13:27:32,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:27:32,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:27:32,546 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:27:32,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:27:32,547 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:27:32,548 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:27:32,548 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:27:32,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:27:32,563 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:27:32,563 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:27:32,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:27:32,566 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:27:32,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:27:32,567 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:27:32,567 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:27:32,567 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:27:32,567 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:27:32,567 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:27:32,568 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:27:32,569 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:27:32,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:27:32,569 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:27:32,569 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:27:32,569 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:27:32,569 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:27:32,570 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:27:32,570 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:27:32,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:27:32,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:27:32,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:27:32,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:27:32,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:27:32,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:27:32,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:27:32,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:27:32,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:27:32,571 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:27:32,571 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:27:32,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:27:32,573 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 -> e94333448b9ec2a5ffed0adee00d968fb025c54e55196475ef51117fcee9fc3a [2024-11-12 13:27:32,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:27:32,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:27:32,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:27:32,788 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:27:32,788 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:27:32,789 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test15-1.i [2024-11-12 13:27:33,955 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:27:34,169 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:27:34,170 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test15-1.i [2024-11-12 13:27:34,180 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/293056e72/cc01c7d8f4b14b1598ffd05ea9c07fe2/FLAG9fc229de5 [2024-11-12 13:27:34,193 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/293056e72/cc01c7d8f4b14b1598ffd05ea9c07fe2 [2024-11-12 13:27:34,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:27:34,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:27:34,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:27:34,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:27:34,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:27:34,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:27:34" (1/1) ... [2024-11-12 13:27:34,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c214aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:34, skipping insertion in model container [2024-11-12 13:27:34,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:27:34" (1/1) ... [2024-11-12 13:27:34,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:27:34,518 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:27:34,563 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:27:34,567 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:27:34,571 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:27:34,572 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:27:34,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:27:34,592 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-12 13:27:34,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1935c8cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:34, skipping insertion in model container [2024-11-12 13:27:34,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:27:34,593 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-12 13:27:34,594 INFO L158 Benchmark]: Toolchain (without parser) took 392.97ms. Allocated memory is still 178.3MB. Free memory was 108.7MB in the beginning and 142.7MB in the end (delta: -34.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 13:27:34,594 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 178.3MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 13:27:34,595 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.18ms. Allocated memory is still 178.3MB. Free memory was 108.5MB in the beginning and 142.7MB in the end (delta: -34.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 13:27:34,596 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.17ms. Allocated memory is still 178.3MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.18ms. Allocated memory is still 178.3MB. Free memory was 108.5MB in the beginning and 142.7MB in the end (delta: -34.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 607]: 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/ldv-memsafety/memleaks_test15-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e94333448b9ec2a5ffed0adee00d968fb025c54e55196475ef51117fcee9fc3a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:27:36,127 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:27:36,184 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-12 13:27:36,187 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:27:36,188 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:27:36,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:27:36,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:27:36,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:27:36,212 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:27:36,213 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:27:36,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:27:36,213 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:27:36,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:27:36,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:27:36,215 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:27:36,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:27:36,216 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:27:36,216 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:27:36,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:27:36,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:27:36,216 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:27:36,219 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:27:36,219 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:27:36,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:27:36,220 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:27:36,220 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 13:27:36,220 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:27:36,220 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 13:27:36,220 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:27:36,220 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:27:36,221 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:27:36,221 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:27:36,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:27:36,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:27:36,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:27:36,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:27:36,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:27:36,222 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:27:36,222 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 13:27:36,222 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 13:27:36,222 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:27:36,222 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:27:36,222 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:27:36,223 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:27:36,223 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 -> e94333448b9ec2a5ffed0adee00d968fb025c54e55196475ef51117fcee9fc3a [2024-11-12 13:27:36,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:27:36,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:27:36,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:27:36,469 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:27:36,469 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:27:36,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test15-1.i [2024-11-12 13:27:37,693 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:27:37,889 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:27:37,890 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test15-1.i [2024-11-12 13:27:37,904 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/177784b74/e19a198f963e458f9dd45573940d46c4/FLAG7faa60cbc [2024-11-12 13:27:38,246 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/177784b74/e19a198f963e458f9dd45573940d46c4 [2024-11-12 13:27:38,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:27:38,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:27:38,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:27:38,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:27:38,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:27:38,254 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:27:38" (1/1) ... [2024-11-12 13:27:38,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5683fb03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:38, skipping insertion in model container [2024-11-12 13:27:38,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:27:38" (1/1) ... [2024-11-12 13:27:38,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:27:38,541 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:27:38,594 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:27:38,601 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:27:38,602 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:27:38,603 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:27:38,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:27:38,627 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-12 13:27:38,633 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:27:38,660 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:27:38,686 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:27:38,689 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:27:38,692 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:27:38,693 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:27:38,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:27:38,701 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:27:38,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:27:38,782 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:27:38,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:38 WrapperNode [2024-11-12 13:27:38,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:27:38,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:27:38,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:27:38,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:27:38,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:38" (1/1) ... [2024-11-12 13:27:38,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:38" (1/1) ... [2024-11-12 13:27:38,842 INFO L138 Inliner]: procedures = 176, calls = 103, calls flagged for inlining = 31, calls inlined = 14, statements flattened = 184 [2024-11-12 13:27:38,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:27:38,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:27:38,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:27:38,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:27:38,851 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:38" (1/1) ... [2024-11-12 13:27:38,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:38" (1/1) ... [2024-11-12 13:27:38,858 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:38" (1/1) ... [2024-11-12 13:27:38,888 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 8 writes are split as follows [0, 8]. [2024-11-12 13:27:38,889 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:38" (1/1) ... [2024-11-12 13:27:38,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:38" (1/1) ... [2024-11-12 13:27:38,895 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:38" (1/1) ... [2024-11-12 13:27:38,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:38" (1/1) ... [2024-11-12 13:27:38,898 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:38" (1/1) ... [2024-11-12 13:27:38,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:38" (1/1) ... [2024-11-12 13:27:38,902 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:27:38,902 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:27:38,902 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:27:38,902 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:27:38,903 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:38" (1/1) ... [2024-11-12 13:27:38,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:27:38,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:27:38,929 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 13:27:38,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 13:27:38,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 13:27:38,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 13:27:38,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 13:27:38,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 13:27:38,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 13:27:38,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 13:27:38,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 13:27:38,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 13:27:38,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-12 13:27:38,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-12 13:27:38,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 13:27:38,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 13:27:38,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:27:38,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-12 13:27:38,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-12 13:27:38,983 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-11-12 13:27:38,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-11-12 13:27:38,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:27:38,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:27:39,117 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:27:39,119 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:27:39,513 INFO L? ?]: Removed 164 outVars from TransFormulas that were not future-live. [2024-11-12 13:27:39,513 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:27:39,530 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:27:39,530 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 13:27:39,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:27:39 BoogieIcfgContainer [2024-11-12 13:27:39,531 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:27:39,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:27:39,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:27:39,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:27:39,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:27:38" (1/3) ... [2024-11-12 13:27:39,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5eefbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:27:39, skipping insertion in model container [2024-11-12 13:27:39,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:38" (2/3) ... [2024-11-12 13:27:39,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5eefbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:27:39, skipping insertion in model container [2024-11-12 13:27:39,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:27:39" (3/3) ... [2024-11-12 13:27:39,537 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test15-1.i [2024-11-12 13:27:39,548 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:27:39,549 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2024-11-12 13:27:39,586 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:27:39,591 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;@5e887702, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:27:39,592 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-12 13:27:39,597 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 74 states have (on average 1.8108108108108107) internal successors, (134), 124 states have internal predecessors, (134), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:27:39,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:27:39,602 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:27:39,602 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:27:39,603 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-12 13:27:39,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:27:39,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1888803226, now seen corresponding path program 1 times [2024-11-12 13:27:39,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:27:39,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645847751] [2024-11-12 13:27:39,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:27:39,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:27:39,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:27:39,619 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:27:39,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 13:27:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:27:39,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 13:27:39,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:27:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:27:39,766 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:27:39,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:27:39,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645847751] [2024-11-12 13:27:39,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645847751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:27:39,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:27:39,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:27:39,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4768225] [2024-11-12 13:27:39,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:27:39,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:27:39,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:27:39,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:27:39,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:27:39,792 INFO L87 Difference]: Start difference. First operand has 130 states, 74 states have (on average 1.8108108108108107) internal successors, (134), 124 states have internal predecessors, (134), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:27:39,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:27:39,858 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2024-11-12 13:27:39,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:27:39,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2024-11-12 13:27:39,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:27:39,868 INFO L225 Difference]: With dead ends: 130 [2024-11-12 13:27:39,869 INFO L226 Difference]: Without dead ends: 128 [2024-11-12 13:27:39,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:27:39,876 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 118 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:27:39,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 522 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:27:39,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-12 13:27:39,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-12 13:27:39,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 73 states have (on average 1.7945205479452055) internal successors, (131), 122 states have internal predecessors, (131), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:27:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2024-11-12 13:27:39,921 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 11 [2024-11-12 13:27:39,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:27:39,922 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2024-11-12 13:27:39,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:27:39,923 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2024-11-12 13:27:39,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 13:27:39,923 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:27:39,923 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:27:39,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 13:27:40,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:27:40,124 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-12 13:27:40,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:27:40,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1971915274, now seen corresponding path program 1 times [2024-11-12 13:27:40,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:27:40,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815794770] [2024-11-12 13:27:40,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:27:40,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:27:40,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:27:40,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:27:40,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 13:27:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:27:40,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 13:27:40,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:27:40,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:27:40,259 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:27:40,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:27:40,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815794770] [2024-11-12 13:27:40,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815794770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:27:40,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:27:40,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:27:40,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074843580] [2024-11-12 13:27:40,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:27:40,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:27:40,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:27:40,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:27:40,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:27:40,262 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 13:27:40,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:27:40,363 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2024-11-12 13:27:40,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:27:40,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-11-12 13:27:40,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:27:40,365 INFO L225 Difference]: With dead ends: 128 [2024-11-12 13:27:40,365 INFO L226 Difference]: Without dead ends: 128 [2024-11-12 13:27:40,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:27:40,368 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 103 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:27:40,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 485 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:27:40,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-12 13:27:40,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-12 13:27:40,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 73 states have (on average 1.7808219178082192) internal successors, (130), 122 states have internal predecessors, (130), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:27:40,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2024-11-12 13:27:40,381 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 17 [2024-11-12 13:27:40,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:27:40,381 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2024-11-12 13:27:40,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 13:27:40,381 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2024-11-12 13:27:40,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:27:40,382 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:27:40,382 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:27:40,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 13:27:40,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:27:40,583 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-12 13:27:40,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:27:40,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1080922302, now seen corresponding path program 1 times [2024-11-12 13:27:40,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:27:40,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885741891] [2024-11-12 13:27:40,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:27:40,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:27:40,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:27:40,586 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:27:40,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 13:27:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:27:40,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 13:27:40,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:27:40,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:27:40,749 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (= (store |c_old(#valid)| |ldv_zalloc_#t~malloc13#1.base| (_ bv1 1)) |c_#valid|)) is different from true [2024-11-12 13:27:40,777 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-12 13:27:40,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-12 13:27:40,790 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2024-11-12 13:27:40,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:27:40,932 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:27:40,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:27:40,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885741891] [2024-11-12 13:27:40,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885741891] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:27:40,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:27:40,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2024-11-12 13:27:40,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906325922] [2024-11-12 13:27:40,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:27:40,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:27:40,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:27:40,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:27:40,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2024-11-12 13:27:40,936 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 13:27:41,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:27:41,363 INFO L93 Difference]: Finished difference Result 160 states and 175 transitions. [2024-11-12 13:27:41,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:27:41,363 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 22 [2024-11-12 13:27:41,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:27:41,364 INFO L225 Difference]: With dead ends: 160 [2024-11-12 13:27:41,364 INFO L226 Difference]: Without dead ends: 160 [2024-11-12 13:27:41,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2024-11-12 13:27:41,365 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 99 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:27:41,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 488 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 374 Invalid, 0 Unknown, 172 Unchecked, 0.4s Time] [2024-11-12 13:27:41,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-12 13:27:41,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 141. [2024-11-12 13:27:41,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 89 states have (on average 1.7415730337078652) internal successors, (155), 135 states have internal predecessors, (155), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:27:41,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2024-11-12 13:27:41,373 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 22 [2024-11-12 13:27:41,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:27:41,373 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2024-11-12 13:27:41,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 13:27:41,373 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2024-11-12 13:27:41,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:27:41,374 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:27:41,374 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:27:41,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 13:27:41,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:27:41,577 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-12 13:27:41,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:27:41,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1080922303, now seen corresponding path program 1 times [2024-11-12 13:27:41,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:27:41,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724762065] [2024-11-12 13:27:41,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:27:41,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:27:41,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:27:41,581 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:27:41,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 13:27:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:27:41,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-12 13:27:41,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:27:41,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:27:41,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:27:41,768 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (= |c_#length| (store |c_old(#length)| |ldv_zalloc_#t~malloc13#1.base| (select |c_#length| |ldv_zalloc_#t~malloc13#1.base|))))) is different from true [2024-11-12 13:27:41,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:27:41,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:27:41,814 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:27:41,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:27:41,832 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2024-11-12 13:27:41,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:27:45,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:27:45,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724762065] [2024-11-12 13:27:45,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724762065] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:27:45,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1260669277] [2024-11-12 13:27:45,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:27:45,968 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 13:27:45,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 13:27:45,970 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 13:27:45,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-12 13:27:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:27:46,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-12 13:27:46,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:27:46,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:27:46,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:27:46,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:27:46,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:27:46,199 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:27:46,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:27:46,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2024-11-12 13:27:46,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:27:46,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1260669277] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:27:46,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:27:46,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-12 13:27:46,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496374605] [2024-11-12 13:27:46,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:27:46,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:27:46,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:27:46,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:27:46,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=69, Unknown=2, NotChecked=16, Total=110 [2024-11-12 13:27:46,307 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:27:46,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:27:46,800 INFO L93 Difference]: Finished difference Result 167 states and 190 transitions. [2024-11-12 13:27:46,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:27:46,800 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-12 13:27:46,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:27:46,801 INFO L225 Difference]: With dead ends: 167 [2024-11-12 13:27:46,801 INFO L226 Difference]: Without dead ends: 167 [2024-11-12 13:27:46,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=29, Invalid=105, Unknown=2, NotChecked=20, Total=156 [2024-11-12 13:27:46,802 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 131 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:27:46,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 372 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 387 Invalid, 0 Unknown, 162 Unchecked, 0.4s Time] [2024-11-12 13:27:46,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-12 13:27:46,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 136. [2024-11-12 13:27:46,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 89 states have (on average 1.6629213483146068) internal successors, (148), 130 states have internal predecessors, (148), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:27:46,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 156 transitions. [2024-11-12 13:27:46,816 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 156 transitions. Word has length 22 [2024-11-12 13:27:46,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:27:46,816 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 156 transitions. [2024-11-12 13:27:46,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:27:46,816 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2024-11-12 13:27:46,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 13:27:46,817 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:27:46,817 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:27:46,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-12 13:27:47,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-12 13:27:47,217 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-12 13:27:47,218 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-12 13:27:47,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:27:47,218 INFO L85 PathProgramCache]: Analyzing trace with hash -109247454, now seen corresponding path program 1 times [2024-11-12 13:27:47,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:27:47,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982366408] [2024-11-12 13:27:47,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:27:47,219 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:27:47,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:27:47,220 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:27:47,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 13:27:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:27:47,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 13:27:47,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:27:47,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-12 13:27:47,318 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 20 treesize of output 8 [2024-11-12 13:27:47,325 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 13:27:47,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:27:47,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:27:47,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982366408] [2024-11-12 13:27:47,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982366408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:27:47,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:27:47,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:27:47,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982751347] [2024-11-12 13:27:47,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:27:47,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:27:47,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:27:47,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:27:47,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:27:47,327 INFO L87 Difference]: Start difference. First operand 136 states and 156 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 13:27:47,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:27:47,445 INFO L93 Difference]: Finished difference Result 133 states and 151 transitions. [2024-11-12 13:27:47,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:27:47,446 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-11-12 13:27:47,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:27:47,447 INFO L225 Difference]: With dead ends: 133 [2024-11-12 13:27:47,447 INFO L226 Difference]: Without dead ends: 133 [2024-11-12 13:27:47,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:27:47,448 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 6 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:27:47,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 705 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:27:47,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-12 13:27:47,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-12 13:27:47,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 86 states have (on average 1.6627906976744187) internal successors, (143), 127 states have internal predecessors, (143), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:27:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 151 transitions. [2024-11-12 13:27:47,460 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 151 transitions. Word has length 27 [2024-11-12 13:27:47,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:27:47,460 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 151 transitions. [2024-11-12 13:27:47,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 13:27:47,460 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 151 transitions. [2024-11-12 13:27:47,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 13:27:47,461 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:27:47,461 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:27:47,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-12 13:27:47,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:27:47,663 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-12 13:27:47,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:27:47,664 INFO L85 PathProgramCache]: Analyzing trace with hash 908221985, now seen corresponding path program 1 times [2024-11-12 13:27:47,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:27:47,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210664391] [2024-11-12 13:27:47,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:27:47,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-12 13:27:47,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:27:47,666 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:27:47,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 13:27:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:27:47,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 13:27:47,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:27:47,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:27:47,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-12 13:27:47,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 13:27:47,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 13:27:47,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:27:47,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:27:47,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210664391] [2024-11-12 13:27:47,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210664391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:27:47,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:27:47,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:27:47,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329610911] [2024-11-12 13:27:47,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:27:47,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:27:47,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:27:47,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:27:47,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:27:47,782 INFO L87 Difference]: Start difference. First operand 133 states and 151 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 13:27:48,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:27:48,024 INFO L93 Difference]: Finished difference Result 132 states and 150 transitions. [2024-11-12 13:27:48,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:27:48,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-11-12 13:27:48,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:27:48,025 INFO L225 Difference]: With dead ends: 132 [2024-11-12 13:27:48,025 INFO L226 Difference]: Without dead ends: 132 [2024-11-12 13:27:48,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:27:48,026 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 3 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:27:48,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 497 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:27:48,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-12 13:27:48,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-12 13:27:48,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 86 states have (on average 1.6511627906976745) internal successors, (142), 126 states have internal predecessors, (142), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:27:48,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 150 transitions. [2024-11-12 13:27:48,030 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 150 transitions. Word has length 28 [2024-11-12 13:27:48,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:27:48,030 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 150 transitions. [2024-11-12 13:27:48,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 13:27:48,031 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 150 transitions. [2024-11-12 13:27:48,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 13:27:48,031 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:27:48,031 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:27:48,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-12 13:27:48,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:27:48,232 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-12 13:27:48,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:27:48,232 INFO L85 PathProgramCache]: Analyzing trace with hash 908221986, now seen corresponding path program 1 times [2024-11-12 13:27:48,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:27:48,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963678520] [2024-11-12 13:27:48,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:27:48,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:27:48,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:27:48,235 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:27:48,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-12 13:27:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:27:48,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-12 13:27:48,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:27:48,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:27:48,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-12 13:27:48,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-12 13:27:48,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-12 13:27:48,404 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 13:27:48,404 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:27:48,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:27:48,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963678520] [2024-11-12 13:27:48,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963678520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:27:48,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:27:48,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:27:48,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796545643] [2024-11-12 13:27:48,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:27:48,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:27:48,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:27:48,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:27:48,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:27:48,405 INFO L87 Difference]: Start difference. First operand 132 states and 150 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 13:27:48,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:27:48,689 INFO L93 Difference]: Finished difference Result 131 states and 149 transitions. [2024-11-12 13:27:48,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:27:48,689 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-11-12 13:27:48,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:27:48,690 INFO L225 Difference]: With dead ends: 131 [2024-11-12 13:27:48,690 INFO L226 Difference]: Without dead ends: 131 [2024-11-12 13:27:48,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:27:48,691 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:27:48,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 544 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:27:48,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-12 13:27:48,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-12 13:27:48,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 86 states have (on average 1.6395348837209303) internal successors, (141), 125 states have internal predecessors, (141), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:27:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 149 transitions. [2024-11-12 13:27:48,698 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 149 transitions. Word has length 28 [2024-11-12 13:27:48,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:27:48,699 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 149 transitions. [2024-11-12 13:27:48,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 13:27:48,699 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2024-11-12 13:27:48,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-12 13:27:48,699 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:27:48,699 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:27:48,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-12 13:27:48,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:27:48,900 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-12 13:27:48,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:27:48,901 INFO L85 PathProgramCache]: Analyzing trace with hash 922966850, now seen corresponding path program 1 times [2024-11-12 13:27:48,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:27:48,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479035860] [2024-11-12 13:27:48,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:27:48,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:27:48,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:27:48,903 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:27:48,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-12 13:27:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:27:48,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-12 13:27:48,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:27:48,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:27:49,070 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-12 13:27:49,071 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 21 treesize of output 20 [2024-11-12 13:27:57,241 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-12 13:27:57,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-12 13:27:57,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-12 13:27:57,347 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 13 treesize of output 7 [2024-11-12 13:27:57,368 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 3 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:27:57,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:28:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:28:09,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:09,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479035860] [2024-11-12 13:28:09,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479035860] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:28:09,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:28:09,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 13 [2024-11-12 13:28:09,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847212784] [2024-11-12 13:28:09,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:28:09,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 13:28:09,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:09,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 13:28:09,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=140, Unknown=4, NotChecked=0, Total=182 [2024-11-12 13:28:09,721 INFO L87 Difference]: Start difference. First operand 131 states and 149 transitions. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-12 13:28:18,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:18,806 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2024-11-12 13:28:18,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:28:18,806 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 30 [2024-11-12 13:28:18,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:18,807 INFO L225 Difference]: With dead ends: 154 [2024-11-12 13:28:18,807 INFO L226 Difference]: Without dead ends: 154 [2024-11-12 13:28:18,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 28.5s TimeCoverageRelationStatistics Valid=52, Invalid=182, Unknown=6, NotChecked=0, Total=240 [2024-11-12 13:28:18,808 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 85 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:18,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 847 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 638 Invalid, 2 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 13:28:18,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-12 13:28:18,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2024-11-12 13:28:18,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 86 states have (on average 1.627906976744186) internal successors, (140), 124 states have internal predecessors, (140), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:28:18,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2024-11-12 13:28:18,811 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 30 [2024-11-12 13:28:18,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:18,811 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2024-11-12 13:28:18,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-12 13:28:18,811 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2024-11-12 13:28:18,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-12 13:28:18,812 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:18,812 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:18,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-12 13:28:19,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:19,013 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-12 13:28:19,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:19,013 INFO L85 PathProgramCache]: Analyzing trace with hash 922966851, now seen corresponding path program 1 times [2024-11-12 13:28:19,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:19,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409965104] [2024-11-12 13:28:19,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:19,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:19,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:19,016 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:28:19,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-12 13:28:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:19,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 13:28:19,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:19,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:28:19,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:28:19,264 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |ldv_zalloc_#t~malloc13#1.base| (select |c_#valid| |ldv_zalloc_#t~malloc13#1.base|)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (= |c_#length| (store |c_old(#length)| |ldv_zalloc_#t~malloc13#1.base| (select |c_#length| |ldv_zalloc_#t~malloc13#1.base|))))) is different from true [2024-11-12 13:28:19,363 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-12 13:28:19,363 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 21 treesize of output 20 [2024-11-12 13:28:19,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:28:19,412 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (= |c_#length| (store |c_old(#length)| |ldv_zalloc_#t~malloc13#1.base| (select |c_#length| |ldv_zalloc_#t~malloc13#1.base|))))) is different from true [2024-11-12 13:28:19,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:28:19,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:28:19,457 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:28:19,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:28:19,530 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 9 not checked. [2024-11-12 13:28:19,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:28:23,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:23,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409965104] [2024-11-12 13:28:23,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [409965104] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:28:23,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [430143664] [2024-11-12 13:28:23,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:23,880 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 13:28:23,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 13:28:23,883 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 13:28:23,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-12 13:28:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:24,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-12 13:28:24,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:24,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:28:24,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:28:24,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:28:24,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:28:24,165 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-12 13:28:24,166 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 21 treesize of output 20 [2024-11-12 13:28:24,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:28:24,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:28:24,252 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:28:24,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:28:24,290 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 9 not checked. [2024-11-12 13:28:24,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:28:24,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [430143664] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:28:24,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:28:24,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-12 13:28:24,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113088980] [2024-11-12 13:28:24,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:28:24,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:28:24,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:24,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:28:24,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=70, Unknown=3, NotChecked=34, Total=132 [2024-11-12 13:28:24,565 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:28:25,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:25,196 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2024-11-12 13:28:25,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:28:25,197 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2024-11-12 13:28:25,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:25,198 INFO L225 Difference]: With dead ends: 152 [2024-11-12 13:28:25,198 INFO L226 Difference]: Without dead ends: 152 [2024-11-12 13:28:25,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=31, Invalid=106, Unknown=3, NotChecked=42, Total=182 [2024-11-12 13:28:25,198 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 223 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 322 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:25,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 319 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 357 Invalid, 0 Unknown, 322 Unchecked, 0.5s Time] [2024-11-12 13:28:25,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-12 13:28:25,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 128. [2024-11-12 13:28:25,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 86 states have (on average 1.6046511627906976) internal successors, (138), 122 states have internal predecessors, (138), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:28:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 146 transitions. [2024-11-12 13:28:25,202 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 146 transitions. Word has length 30 [2024-11-12 13:28:25,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:25,202 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 146 transitions. [2024-11-12 13:28:25,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:28:25,202 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 146 transitions. [2024-11-12 13:28:25,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-12 13:28:25,207 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:25,208 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:25,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-12 13:28:25,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2024-11-12 13:28:25,608 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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-12 13:28:25,609 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-12 13:28:25,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:25,609 INFO L85 PathProgramCache]: Analyzing trace with hash -2087086940, now seen corresponding path program 1 times [2024-11-12 13:28:25,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:25,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693160379] [2024-11-12 13:28:25,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:25,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:25,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:25,611 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:28:25,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-12 13:28:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:25,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 13:28:25,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 13:28:25,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:28:25,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 6 [2024-11-12 13:28:26,076 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 13:28:26,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:26,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1693160379] [2024-11-12 13:28:26,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1693160379] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:28:26,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:28:26,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-11-12 13:28:26,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223078296] [2024-11-12 13:28:26,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:28:26,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 13:28:26,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:26,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 13:28:26,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-12 13:28:26,078 INFO L87 Difference]: Start difference. First operand 128 states and 146 transitions. Second operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 13:28:26,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:26,513 INFO L93 Difference]: Finished difference Result 174 states and 195 transitions. [2024-11-12 13:28:26,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:28:26,514 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 32 [2024-11-12 13:28:26,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:26,515 INFO L225 Difference]: With dead ends: 174 [2024-11-12 13:28:26,515 INFO L226 Difference]: Without dead ends: 174 [2024-11-12 13:28:26,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-12 13:28:26,515 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 154 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:26,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 630 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:28:26,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-12 13:28:26,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 127. [2024-11-12 13:28:26,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 86 states have (on average 1.5930232558139534) internal successors, (137), 121 states have internal predecessors, (137), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:28:26,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2024-11-12 13:28:26,518 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 32 [2024-11-12 13:28:26,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:26,518 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2024-11-12 13:28:26,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 13:28:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2024-11-12 13:28:26,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-12 13:28:26,519 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:26,519 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:26,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-12 13:28:26,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:26,720 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-12 13:28:26,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:26,720 INFO L85 PathProgramCache]: Analyzing trace with hash -2087086941, now seen corresponding path program 1 times [2024-11-12 13:28:26,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:26,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715385914] [2024-11-12 13:28:26,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:26,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:26,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:26,723 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:28:26,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-12 13:28:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:26,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 13:28:26,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:26,830 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 13:28:26,830 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:28:26,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:26,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715385914] [2024-11-12 13:28:26,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715385914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:28:26,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:28:26,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:28:26,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284046897] [2024-11-12 13:28:26,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:28:26,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:28:26,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:26,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:28:26,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:28:26,831 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 13:28:26,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:26,989 INFO L93 Difference]: Finished difference Result 163 states and 184 transitions. [2024-11-12 13:28:26,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:28:26,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2024-11-12 13:28:26,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:26,990 INFO L225 Difference]: With dead ends: 163 [2024-11-12 13:28:26,990 INFO L226 Difference]: Without dead ends: 163 [2024-11-12 13:28:26,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:28:26,991 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 63 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:26,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 232 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:28:26,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-12 13:28:26,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 126. [2024-11-12 13:28:26,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 86 states have (on average 1.5813953488372092) internal successors, (136), 120 states have internal predecessors, (136), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:28:26,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 144 transitions. [2024-11-12 13:28:26,994 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 144 transitions. Word has length 32 [2024-11-12 13:28:26,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:26,994 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 144 transitions. [2024-11-12 13:28:26,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 13:28:26,994 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 144 transitions. [2024-11-12 13:28:26,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-12 13:28:26,995 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:26,995 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:26,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-12 13:28:27,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:27,195 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-12 13:28:27,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:27,195 INFO L85 PathProgramCache]: Analyzing trace with hash 59177540, now seen corresponding path program 1 times [2024-11-12 13:28:27,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:27,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170489100] [2024-11-12 13:28:27,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:27,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:27,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:27,198 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:28:27,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-12 13:28:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:27,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-12 13:28:27,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:27,426 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 15 treesize of output 1 [2024-11-12 13:28:27,477 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 19 treesize of output 11 [2024-11-12 13:28:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 13:28:27,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:28:27,600 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 13:28:27,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:27,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170489100] [2024-11-12 13:28:27,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170489100] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 13:28:27,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:28:27,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14 [2024-11-12 13:28:27,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304877114] [2024-11-12 13:28:27,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:28:27,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:28:27,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:27,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:28:27,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-12 13:28:27,601 INFO L87 Difference]: Start difference. First operand 126 states and 144 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 13:28:27,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:27,997 INFO L93 Difference]: Finished difference Result 156 states and 177 transitions. [2024-11-12 13:28:27,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:28:27,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2024-11-12 13:28:27,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:27,998 INFO L225 Difference]: With dead ends: 156 [2024-11-12 13:28:27,998 INFO L226 Difference]: Without dead ends: 156 [2024-11-12 13:28:27,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-12 13:28:27,999 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 74 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:27,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 433 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:28:27,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-12 13:28:28,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 125. [2024-11-12 13:28:28,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 86 states have (on average 1.569767441860465) internal successors, (135), 119 states have internal predecessors, (135), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:28:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 143 transitions. [2024-11-12 13:28:28,003 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 143 transitions. Word has length 34 [2024-11-12 13:28:28,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:28,003 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 143 transitions. [2024-11-12 13:28:28,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 13:28:28,004 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 143 transitions. [2024-11-12 13:28:28,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-12 13:28:28,004 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:28,004 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:28,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-12 13:28:28,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:28,205 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-12 13:28:28,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:28,205 INFO L85 PathProgramCache]: Analyzing trace with hash 59177541, now seen corresponding path program 1 times [2024-11-12 13:28:28,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:28,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721297855] [2024-11-12 13:28:28,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:28,206 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:28,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:28,208 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:28:28,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-12 13:28:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:28,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 13:28:28,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:28,449 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 15 treesize of output 1 [2024-11-12 13:28:28,455 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 11 treesize of output 7 [2024-11-12 13:28:28,510 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 17 treesize of output 9 [2024-11-12 13:28:28,565 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 13:28:28,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:28:28,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 6 [2024-11-12 13:28:29,043 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 13:28:29,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:29,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1721297855] [2024-11-12 13:28:29,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1721297855] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:28:29,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:28:29,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2024-11-12 13:28:29,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054018261] [2024-11-12 13:28:29,044 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:28:29,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 13:28:29,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:29,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 13:28:29,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2024-11-12 13:28:29,045 INFO L87 Difference]: Start difference. First operand 125 states and 143 transitions. Second operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 19 states have internal predecessors, (45), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 13:28:30,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:30,057 INFO L93 Difference]: Finished difference Result 158 states and 180 transitions. [2024-11-12 13:28:30,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 13:28:30,057 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 19 states have internal predecessors, (45), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2024-11-12 13:28:30,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:30,058 INFO L225 Difference]: With dead ends: 158 [2024-11-12 13:28:30,058 INFO L226 Difference]: Without dead ends: 158 [2024-11-12 13:28:30,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2024-11-12 13:28:30,058 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 308 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:30,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1114 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 13:28:30,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-12 13:28:30,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 124. [2024-11-12 13:28:30,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 86 states have (on average 1.558139534883721) internal successors, (134), 118 states have internal predecessors, (134), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:28:30,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 142 transitions. [2024-11-12 13:28:30,061 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 142 transitions. Word has length 34 [2024-11-12 13:28:30,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:30,061 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 142 transitions. [2024-11-12 13:28:30,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 19 states have internal predecessors, (45), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 13:28:30,062 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 142 transitions. [2024-11-12 13:28:30,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-12 13:28:30,063 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:30,064 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:30,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-12 13:28:30,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:30,265 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-12 13:28:30,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:30,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1834503763, now seen corresponding path program 1 times [2024-11-12 13:28:30,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:30,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323125317] [2024-11-12 13:28:30,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:30,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:30,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:30,267 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:28:30,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-12 13:28:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:30,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-12 13:28:30,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:30,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:28:30,516 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-12 13:28:30,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-12 13:28:30,707 INFO L349 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2024-11-12 13:28:30,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2024-11-12 13:28:30,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 13:28:31,091 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-12 13:28:31,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2024-11-12 13:28:31,145 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 11 treesize of output 7 [2024-11-12 13:28:31,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 59 treesize of output 31 [2024-11-12 13:28:31,302 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 7 treesize of output 3 [2024-11-12 13:28:31,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:28:31,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 33 [2024-11-12 13:28:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:28:31,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:28:31,977 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_entry_point_~intf~2#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse1) v_ArrVal_339))) (store .cse0 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse0 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) (bvadd |c_ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv8 32)) |c_ULTIMATE.start_entry_point_~intf~2#1.base|))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse1)))))) is different from false [2024-11-12 13:28:32,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:28:32,013 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 40 [2024-11-12 13:28:32,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:28:32,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 196 treesize of output 194 [2024-11-12 13:28:32,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 210 treesize of output 194 [2024-11-12 13:28:32,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 143 treesize of output 131 [2024-11-12 13:28:40,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:40,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323125317] [2024-11-12 13:28:40,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323125317] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:28:40,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [562587422] [2024-11-12 13:28:40,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:40,793 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 13:28:40,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 13:28:40,795 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 13:28:40,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-11-12 13:28:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:40,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-12 13:28:40,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:40,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:28:41,076 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-12 13:28:41,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-12 13:28:41,175 INFO L349 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2024-11-12 13:28:41,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2024-11-12 13:28:41,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 13:28:41,436 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-12 13:28:41,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2024-11-12 13:28:41,496 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 11 treesize of output 7 [2024-11-12 13:28:41,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 59 treesize of output 31 [2024-11-12 13:28:41,582 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 7 treesize of output 3 [2024-11-12 13:28:41,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:28:41,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 33 [2024-11-12 13:28:41,708 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:28:41,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:28:42,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:28:42,501 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 40 [2024-11-12 13:28:42,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:28:42,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 196 treesize of output 194 [2024-11-12 13:28:42,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 210 treesize of output 194 [2024-11-12 13:28:42,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 200 treesize of output 172 [2024-11-12 13:28:53,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [562587422] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:28:53,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:28:53,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2024-11-12 13:28:53,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451382804] [2024-11-12 13:28:53,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:28:53,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-12 13:28:53,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:53,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-12 13:28:53,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1334, Unknown=26, NotChecked=74, Total=1560 [2024-11-12 13:28:53,131 INFO L87 Difference]: Start difference. First operand 124 states and 142 transitions. Second operand has 21 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:28:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:55,727 INFO L93 Difference]: Finished difference Result 184 states and 199 transitions. [2024-11-12 13:28:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 13:28:55,728 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2024-11-12 13:28:55,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:55,729 INFO L225 Difference]: With dead ends: 184 [2024-11-12 13:28:55,729 INFO L226 Difference]: Without dead ends: 184 [2024-11-12 13:28:55,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=218, Invalid=1652, Unknown=26, NotChecked=84, Total=1980 [2024-11-12 13:28:55,729 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 195 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:55,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1441 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-12 13:28:55,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-12 13:28:55,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 123. [2024-11-12 13:28:55,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 86 states have (on average 1.5465116279069768) internal successors, (133), 117 states have internal predecessors, (133), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:28:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 141 transitions. [2024-11-12 13:28:55,732 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 141 transitions. Word has length 35 [2024-11-12 13:28:55,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:55,732 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 141 transitions. [2024-11-12 13:28:55,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:28:55,732 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 141 transitions. [2024-11-12 13:28:55,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-12 13:28:55,732 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:55,732 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:55,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-12 13:28:55,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2024-11-12 13:28:56,133 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,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-12 13:28:56,133 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-12 13:28:56,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:56,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1834503764, now seen corresponding path program 1 times [2024-11-12 13:28:56,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:56,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740661463] [2024-11-12 13:28:56,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:56,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:56,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:56,135 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:28:56,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-12 13:28:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:56,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-12 13:28:56,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:56,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:28:56,373 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-12 13:28:56,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-12 13:28:56,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:28:56,579 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-12 13:28:56,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-12 13:28:56,630 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 11 treesize of output 7 [2024-11-12 13:28:56,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 13:28:56,853 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-12 13:28:56,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2024-11-12 13:28:56,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-12 13:28:56,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 22 [2024-11-12 13:28:56,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 57 treesize of output 29 [2024-11-12 13:28:57,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:28:57,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 31 [2024-11-12 13:28:57,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-12 13:28:57,300 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:28:57,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:28:58,106 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv8 32))) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_entry_point_~intf~2#1.offset|)) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_entry_point_~intf~2#1.offset|))) (and (forall ((v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_#t~mem63#1.base| v_ArrVal_413))) (store .cse0 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse0 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse1 .cse2))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse3)) (select |c_#length| (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_entry_point_#t~mem63#1.base| v_ArrVal_412))) (store .cse4 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse4 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse1 |c_ULTIMATE.start_entry_point_~intf~2#1.base|))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse3)))) (forall ((v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_#t~mem63#1.base| v_ArrVal_413))) (store .cse6 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse6 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse1 .cse2))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse3))) (bvule (bvadd (_ bv7 32) .cse5) (bvadd (_ bv8 32) .cse5)))))) is different from false [2024-11-12 13:28:58,194 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_entry_point_~intf~2#1.offset|))) (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_entry_point_~intf~2#1.offset|)) (.cse2 (bvadd |c_ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv8 32))) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse5))) (and (forall ((v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_413))) (store .cse1 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse1 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse2 .cse3))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse5))) (bvule (bvadd (_ bv7 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_413))) (store .cse6 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse6 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse2 .cse3))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse5)) (select |c_#length| (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_412))) (store .cse7 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse7 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse2 |c_ULTIMATE.start_entry_point_~intf~2#1.base|))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse5))))))) is different from false [2024-11-12 13:28:58,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:28:58,327 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 84 [2024-11-12 13:28:58,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:28:58,342 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 64 [2024-11-12 13:28:58,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:28:58,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 776 treesize of output 766 [2024-11-12 13:28:58,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:28:58,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3088 treesize of output 2982 [2024-11-12 13:28:58,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 292 treesize of output 276 [2024-11-12 13:28:58,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 332 treesize of output 308 [2024-11-12 13:28:58,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 219 treesize of output 203 [2024-11-12 13:29:00,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 271 treesize of output 239 [2024-11-12 13:29:00,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:29:00,658 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 66 [2024-11-12 13:29:00,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:29:00,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 272 treesize of output 262 [2024-11-12 13:29:00,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 260 treesize of output 228 [2024-11-12 13:29:01,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 88 treesize of output 68 [2024-11-12 13:29:01,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 73 treesize of output 71 [2024-11-12 13:29:02,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:02,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740661463] [2024-11-12 13:29:02,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740661463] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:02,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [559361692] [2024-11-12 13:29:02,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:02,150 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 13:29:02,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 13:29:02,152 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 13:29:02,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-11-12 13:29:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:02,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-12 13:29:02,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:02,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:29:02,438 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-12 13:29:02,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-12 13:29:02,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:29:02,547 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-12 13:29:02,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-12 13:29:02,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 13:29:02,598 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 11 treesize of output 7 [2024-11-12 13:29:02,777 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-12 13:29:02,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2024-11-12 13:29:02,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-12 13:29:02,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 22 [2024-11-12 13:29:02,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 57 treesize of output 29 [2024-11-12 13:29:02,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:29:02,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 31 [2024-11-12 13:29:02,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-12 13:29:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:29:02,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:05,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:29:05,444 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 84 [2024-11-12 13:29:05,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:29:05,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 64 [2024-11-12 13:29:05,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:29:05,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 388 treesize of output 386 [2024-11-12 13:29:05,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:29:05,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3088 treesize of output 2982 [2024-11-12 13:29:05,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 292 treesize of output 276 [2024-11-12 13:29:05,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 332 treesize of output 308 [2024-11-12 13:29:05,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 215 treesize of output 199 [2024-11-12 13:29:06,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 158 treesize of output 142 [2024-11-12 13:29:06,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:29:06,965 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 66 [2024-11-12 13:29:07,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:29:07,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 272 treesize of output 262 [2024-11-12 13:29:07,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 260 treesize of output 228 [2024-11-12 13:29:07,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 115 treesize of output 87 [2024-11-12 13:29:08,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 73 treesize of output 71 [2024-11-12 13:29:08,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [559361692] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:08,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:08,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2024-11-12 13:29:08,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99541027] [2024-11-12 13:29:08,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:08,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-12 13:29:08,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:08,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-12 13:29:08,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1286, Unknown=19, NotChecked=146, Total=1560 [2024-11-12 13:29:08,877 INFO L87 Difference]: Start difference. First operand 123 states and 141 transitions. Second operand has 21 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:29:11,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:11,673 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2024-11-12 13:29:11,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 13:29:11,673 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2024-11-12 13:29:11,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:11,674 INFO L225 Difference]: With dead ends: 146 [2024-11-12 13:29:11,674 INFO L226 Difference]: Without dead ends: 146 [2024-11-12 13:29:11,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=248, Invalid=1997, Unknown=19, NotChecked=186, Total=2450 [2024-11-12 13:29:11,675 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 193 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:11,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1032 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 13:29:11,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-12 13:29:11,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2024-11-12 13:29:11,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 86 states have (on average 1.5348837209302326) internal successors, (132), 116 states have internal predecessors, (132), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:29:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 140 transitions. [2024-11-12 13:29:11,678 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 140 transitions. Word has length 35 [2024-11-12 13:29:11,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:11,678 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 140 transitions. [2024-11-12 13:29:11,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:29:11,678 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 140 transitions. [2024-11-12 13:29:11,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-12 13:29:11,679 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:11,679 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:11,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:11,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:12,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:12,080 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-12 13:29:12,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:12,080 INFO L85 PathProgramCache]: Analyzing trace with hash 2021525780, now seen corresponding path program 1 times [2024-11-12 13:29:12,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:12,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [545875172] [2024-11-12 13:29:12,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:12,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:12,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:12,081 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:29:12,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-12 13:29:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:12,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 13:29:12,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:12,210 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 13:29:12,210 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:29:12,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:12,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [545875172] [2024-11-12 13:29:12,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [545875172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:29:12,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:29:12,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:29:12,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790202512] [2024-11-12 13:29:12,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:29:12,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:29:12,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:12,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:29:12,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:29:12,211 INFO L87 Difference]: Start difference. First operand 122 states and 140 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 13:29:12,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:12,404 INFO L93 Difference]: Finished difference Result 158 states and 179 transitions. [2024-11-12 13:29:12,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:29:12,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-11-12 13:29:12,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:12,406 INFO L225 Difference]: With dead ends: 158 [2024-11-12 13:29:12,406 INFO L226 Difference]: Without dead ends: 158 [2024-11-12 13:29:12,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:29:12,406 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 50 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:12,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 300 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:29:12,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-12 13:29:12,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 121. [2024-11-12 13:29:12,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 86 states have (on average 1.5232558139534884) internal successors, (131), 115 states have internal predecessors, (131), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:29:12,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 139 transitions. [2024-11-12 13:29:12,409 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 139 transitions. Word has length 37 [2024-11-12 13:29:12,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:12,409 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 139 transitions. [2024-11-12 13:29:12,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 13:29:12,409 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2024-11-12 13:29:12,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-12 13:29:12,410 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:12,410 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:12,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-12 13:29:12,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:12,610 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-12 13:29:12,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:12,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2021525781, now seen corresponding path program 1 times [2024-11-12 13:29:12,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:12,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313808034] [2024-11-12 13:29:12,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:12,614 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:12,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:12,617 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:29:12,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-12 13:29:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:12,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-12 13:29:12,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:12,847 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 13:29:12,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:12,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 [2024-11-12 13:29:13,263 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 13:29:13,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:13,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313808034] [2024-11-12 13:29:13,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [313808034] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:29:13,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:13,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-12 13:29:13,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755310330] [2024-11-12 13:29:13,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:13,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 13:29:13,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:13,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 13:29:13,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-12 13:29:13,264 INFO L87 Difference]: Start difference. First operand 121 states and 139 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 13:29:13,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:13,916 INFO L93 Difference]: Finished difference Result 167 states and 188 transitions. [2024-11-12 13:29:13,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:29:13,917 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2024-11-12 13:29:13,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:13,917 INFO L225 Difference]: With dead ends: 167 [2024-11-12 13:29:13,917 INFO L226 Difference]: Without dead ends: 167 [2024-11-12 13:29:13,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-11-12 13:29:13,918 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 130 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:13,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1043 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 13:29:13,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-12 13:29:13,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 120. [2024-11-12 13:29:13,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 86 states have (on average 1.5116279069767442) internal successors, (130), 114 states have internal predecessors, (130), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:29:13,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 138 transitions. [2024-11-12 13:29:13,924 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 138 transitions. Word has length 37 [2024-11-12 13:29:13,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:13,924 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 138 transitions. [2024-11-12 13:29:13,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 13:29:13,924 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 138 transitions. [2024-11-12 13:29:13,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-12 13:29:13,926 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:13,927 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-11-12 13:29:13,931 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-12 13:29:14,127 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-12 13:29:14,127 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-12 13:29:14,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:14,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1075864724, now seen corresponding path program 1 times [2024-11-12 13:29:14,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:14,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796933088] [2024-11-12 13:29:14,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:14,128 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:14,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:14,129 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-12 13:29:14,130 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-12 13:29:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:14,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 13:29:14,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:14,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:29:14,285 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 13:29:14,285 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:29:14,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:14,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796933088] [2024-11-12 13:29:14,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1796933088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:29:14,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:29:14,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:29:14,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746943580] [2024-11-12 13:29:14,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:29:14,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:29:14,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:14,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:29:14,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:29:14,286 INFO L87 Difference]: Start difference. First operand 120 states and 138 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 13:29:14,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:14,618 INFO L93 Difference]: Finished difference Result 117 states and 135 transitions. [2024-11-12 13:29:14,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:29:14,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2024-11-12 13:29:14,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:14,619 INFO L225 Difference]: With dead ends: 117 [2024-11-12 13:29:14,619 INFO L226 Difference]: Without dead ends: 117 [2024-11-12 13:29:14,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:29:14,619 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 23 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:14,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 404 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:29:14,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-12 13:29:14,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-11-12 13:29:14,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 86 states have (on average 1.4651162790697674) internal successors, (126), 110 states have internal predecessors, (126), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:29:14,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2024-11-12 13:29:14,624 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 44 [2024-11-12 13:29:14,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:14,624 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2024-11-12 13:29:14,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 13:29:14,624 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2024-11-12 13:29:14,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-12 13:29:14,624 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:14,624 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-11-12 13:29:14,630 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-12 13:29:14,825 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-12 13:29:14,825 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-12 13:29:14,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:14,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1075864725, now seen corresponding path program 1 times [2024-11-12 13:29:14,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:14,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672061495] [2024-11-12 13:29:14,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:14,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:14,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:14,827 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-12 13:29:14,828 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-12 13:29:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:14,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 13:29:14,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:14,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:29:15,052 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 13:29:15,053 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:29:15,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:15,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672061495] [2024-11-12 13:29:15,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672061495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:29:15,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:29:15,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:29:15,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501910612] [2024-11-12 13:29:15,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:29:15,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:29:15,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:15,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:29:15,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:29:15,054 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 13:29:15,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:15,327 INFO L93 Difference]: Finished difference Result 113 states and 131 transitions. [2024-11-12 13:29:15,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:29:15,328 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2024-11-12 13:29:15,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:15,328 INFO L225 Difference]: With dead ends: 113 [2024-11-12 13:29:15,328 INFO L226 Difference]: Without dead ends: 113 [2024-11-12 13:29:15,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:29:15,329 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 17 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:15,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 452 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:29:15,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-12 13:29:15,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-12 13:29:15,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 106 states have internal predecessors, (122), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:29:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2024-11-12 13:29:15,331 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 44 [2024-11-12 13:29:15,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:15,331 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2024-11-12 13:29:15,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 13:29:15,331 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2024-11-12 13:29:15,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-12 13:29:15,331 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:15,331 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:15,336 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 (24)] Ended with exit code 0 [2024-11-12 13:29:15,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:15,532 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-12 13:29:15,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:15,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1210753218, now seen corresponding path program 1 times [2024-11-12 13:29:15,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:15,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594975842] [2024-11-12 13:29:15,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:15,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:15,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:15,534 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:29:15,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-12 13:29:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:15,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 13:29:15,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:15,687 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 13:29:15,688 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:29:15,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:15,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594975842] [2024-11-12 13:29:15,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594975842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:29:15,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:29:15,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:29:15,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666182977] [2024-11-12 13:29:15,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:29:15,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:29:15,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:15,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:29:15,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:29:15,689 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 13:29:15,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:15,853 INFO L93 Difference]: Finished difference Result 149 states and 170 transitions. [2024-11-12 13:29:15,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:29:15,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-12 13:29:15,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:15,854 INFO L225 Difference]: With dead ends: 149 [2024-11-12 13:29:15,854 INFO L226 Difference]: Without dead ends: 149 [2024-11-12 13:29:15,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:29:15,855 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 52 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:15,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 210 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:29:15,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-12 13:29:15,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 118. [2024-11-12 13:29:15,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.423913043478261) internal successors, (131), 112 states have internal predecessors, (131), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:29:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2024-11-12 13:29:15,857 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 44 [2024-11-12 13:29:15,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:15,857 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2024-11-12 13:29:15,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 13:29:15,858 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2024-11-12 13:29:15,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-12 13:29:15,858 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:15,858 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:15,864 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 (25)] Ended with exit code 0 [2024-11-12 13:29:16,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:16,058 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-12 13:29:16,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:16,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1210753217, now seen corresponding path program 1 times [2024-11-12 13:29:16,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:16,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017792453] [2024-11-12 13:29:16,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:16,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:16,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:16,061 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:29:16,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-12 13:29:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:16,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 13:29:16,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:16,297 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 13:29:16,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:16,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 6 [2024-11-12 13:29:16,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 13:29:16,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:16,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017792453] [2024-11-12 13:29:16,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017792453] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:29:16,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:16,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-11-12 13:29:16,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825889082] [2024-11-12 13:29:16,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:16,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 13:29:16,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:16,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 13:29:16,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-12 13:29:16,563 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand has 14 states, 13 states have (on average 5.0) internal successors, (65), 12 states have internal predecessors, (65), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6)