./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test12-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d 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_test12-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f08d75c904d21d6573220c7737d451cd978e8a22a153e855f8d685d88a1eb60 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:32:54,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:32:54,624 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:32:54,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:32:54,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:32:54,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:32:54,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:32:54,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:32:54,652 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:32:54,652 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:32:54,652 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:32:54,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:32:54,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:32:54,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:32:54,657 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:32:54,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:32:54,658 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:32:54,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:32:54,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:32:54,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:32:54,660 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:32:54,660 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:32:54,661 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:32:54,661 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:32:54,661 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:32:54,661 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:32:54,661 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:32:54,662 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:32:54,662 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:32:54,662 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:32:54,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:32:54,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:32:54,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:32:54,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:32:54,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:32:54,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:32:54,663 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:32:54,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:32:54,663 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:32:54,663 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:32:54,663 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:32:54,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:32:54,664 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 -> 7f08d75c904d21d6573220c7737d451cd978e8a22a153e855f8d685d88a1eb60 [2024-11-17 00:32:54,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:32:54,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:32:54,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:32:54,883 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:32:54,883 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:32:54,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test12-2.i [2024-11-17 00:32:56,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:32:56,315 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:32:56,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test12-2.i [2024-11-17 00:32:56,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99dfe2936/7642a5137032498eac241623413fb733/FLAG574a6c3ca [2024-11-17 00:32:56,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99dfe2936/7642a5137032498eac241623413fb733 [2024-11-17 00:32:56,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:32:56,340 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:32:56,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:32:56,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:32:56,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:32:56,345 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:32:56" (1/1) ... [2024-11-17 00:32:56,346 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3495b695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:32:56, skipping insertion in model container [2024-11-17 00:32:56,346 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:32:56" (1/1) ... [2024-11-17 00:32:56,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:32:56,654 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:32:56,718 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:32:56,718 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:32:56,723 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:32:56,724 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:32:56,726 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:32:56,727 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:32:56,727 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:32:56,727 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:32:56,728 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:32:56,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:32:56,744 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-17 00:32:56,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1af22e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:32:56, skipping insertion in model container [2024-11-17 00:32:56,745 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:32:56,746 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-17 00:32:56,747 INFO L158 Benchmark]: Toolchain (without parser) took 406.71ms. Allocated memory is still 167.8MB. Free memory was 94.6MB in the beginning and 76.6MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-17 00:32:56,748 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 123.7MB. Free memory was 84.0MB in the beginning and 83.9MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:32:56,749 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.10ms. Allocated memory is still 167.8MB. Free memory was 94.3MB in the beginning and 76.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-17 00:32:56,750 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.15ms. Allocated memory is still 123.7MB. Free memory was 84.0MB in the beginning and 83.9MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.10ms. Allocated memory is still 167.8MB. Free memory was 94.3MB in the beginning and 76.6MB in the end (delta: 17.8MB). 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_test12-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f08d75c904d21d6573220c7737d451cd978e8a22a153e855f8d685d88a1eb60 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:32:58,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:32:58,434 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-17 00:32:58,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:32:58,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:32:58,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:32:58,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:32:58,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:32:58,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:32:58,465 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:32:58,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:32:58,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:32:58,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:32:58,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:32:58,466 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:32:58,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:32:58,467 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:32:58,467 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:32:58,469 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:32:58,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:32:58,470 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:32:58,470 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:32:58,470 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:32:58,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:32:58,473 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:32:58,473 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 00:32:58,474 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:32:58,474 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 00:32:58,474 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:32:58,474 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:32:58,474 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:32:58,474 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:32:58,474 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:32:58,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:32:58,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:32:58,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:32:58,475 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:32:58,475 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:32:58,475 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 00:32:58,476 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 00:32:58,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:32:58,476 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:32:58,476 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:32:58,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:32:58,478 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 -> 7f08d75c904d21d6573220c7737d451cd978e8a22a153e855f8d685d88a1eb60 [2024-11-17 00:32:58,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:32:58,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:32:58,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:32:58,746 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:32:58,747 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:32:58,748 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test12-2.i [2024-11-17 00:32:59,987 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:33:00,223 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:33:00,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test12-2.i [2024-11-17 00:33:00,243 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75d36351a/1000e816cb38427c8fc94b08ec5685b0/FLAGe2dc7d691 [2024-11-17 00:33:00,254 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75d36351a/1000e816cb38427c8fc94b08ec5685b0 [2024-11-17 00:33:00,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:33:00,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:33:00,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:33:00,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:33:00,263 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:33:00,263 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:33:00" (1/1) ... [2024-11-17 00:33:00,264 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17d86c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:33:00, skipping insertion in model container [2024-11-17 00:33:00,265 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:33:00" (1/1) ... [2024-11-17 00:33:00,309 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:33:00,581 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:33:00,645 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:33:00,646 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:33:00,651 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:33:00,652 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:33:00,654 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:33:00,656 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:33:00,656 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:33:00,657 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:33:00,657 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:33:00,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:33:00,680 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-17 00:33:00,687 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:33:00,716 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:33:00,741 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:33:00,743 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:33:00,745 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:33:00,748 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:33:00,749 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:33:00,749 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:33:00,750 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:33:00,750 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:33:00,751 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:33:00,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:33:00,758 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:33:00,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:33:00,841 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:33:00,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:33:00 WrapperNode [2024-11-17 00:33:00,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:33:00,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:33:00,844 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:33:00,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:33:00,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:33:00" (1/1) ... [2024-11-17 00:33:00,876 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:33:00" (1/1) ... [2024-11-17 00:33:00,916 INFO L138 Inliner]: procedures = 179, calls = 145, calls flagged for inlining = 33, calls inlined = 20, statements flattened = 347 [2024-11-17 00:33:00,916 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:33:00,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:33:00,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:33:00,917 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:33:00,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:33:00" (1/1) ... [2024-11-17 00:33:00,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:33:00" (1/1) ... [2024-11-17 00:33:00,935 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:33:00" (1/1) ... [2024-11-17 00:33:00,986 INFO L175 MemorySlicer]: Split 55 memory accesses to 2 slices as follows [10, 45]. 82 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [8, 2]. The 23 writes are split as follows [0, 23]. [2024-11-17 00:33:00,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:33:00" (1/1) ... [2024-11-17 00:33:00,986 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:33:00" (1/1) ... [2024-11-17 00:33:01,011 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:33:00" (1/1) ... [2024-11-17 00:33:01,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:33:00" (1/1) ... [2024-11-17 00:33:01,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:33:00" (1/1) ... [2024-11-17 00:33:01,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:33:00" (1/1) ... [2024-11-17 00:33:01,031 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:33:01,036 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:33:01,036 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:33:01,036 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:33:01,037 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:33:00" (1/1) ... [2024-11-17 00:33:01,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:33:01,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:33:01,068 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-17 00:33:01,072 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-17 00:33:01,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-17 00:33:01,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-17 00:33:01,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-17 00:33:01,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-17 00:33:01,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-11-17 00:33:01,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-11-17 00:33:01,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-11-17 00:33:01,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-11-17 00:33:01,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2024-11-17 00:33:01,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2024-11-17 00:33:01,108 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2024-11-17 00:33:01,108 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2024-11-17 00:33:01,108 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-11-17 00:33:01,108 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-11-17 00:33:01,108 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-17 00:33:01,108 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-17 00:33:01,108 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-17 00:33:01,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-17 00:33:01,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-17 00:33:01,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-17 00:33:01,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-17 00:33:01,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-17 00:33:01,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:33:01,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:33:01,112 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2024-11-17 00:33:01,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2024-11-17 00:33:01,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 00:33:01,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:33:01,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:33:01,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4#0 [2024-11-17 00:33:01,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4#1 [2024-11-17 00:33:01,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:33:01,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:33:01,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-17 00:33:01,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-17 00:33:01,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:33:01,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-17 00:33:01,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-17 00:33:01,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-17 00:33:01,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-17 00:33:01,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1#0 [2024-11-17 00:33:01,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1#1 [2024-11-17 00:33:01,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:33:01,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:33:01,265 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:33:01,267 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:33:01,697 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc #t~malloc12.base, #t~malloc12.offset; [2024-11-17 00:33:02,291 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L814: havoc ldv_i2c_transfer_#t~mem49#1.base, ldv_i2c_transfer_#t~mem49#1.offset;havoc ldv_i2c_transfer_#t~ret50#1; [2024-11-17 00:33:02,292 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L816: call ULTIMATE.dealloc(ldv_m88ts2022_rd_reg_~#reg#1.base, ldv_m88ts2022_rd_reg_~#reg#1.offset);havoc ldv_m88ts2022_rd_reg_~#reg#1.base, ldv_m88ts2022_rd_reg_~#reg#1.offset;call ULTIMATE.dealloc(ldv_m88ts2022_rd_reg_~#buf~0#1.base, ldv_m88ts2022_rd_reg_~#buf~0#1.offset);havoc ldv_m88ts2022_rd_reg_~#buf~0#1.base, ldv_m88ts2022_rd_reg_~#buf~0#1.offset;call ULTIMATE.dealloc(ldv_m88ts2022_rd_reg_~#msg~2#1.base, ldv_m88ts2022_rd_reg_~#msg~2#1.offset);havoc ldv_m88ts2022_rd_reg_~#msg~2#1.base, ldv_m88ts2022_rd_reg_~#msg~2#1.offset; [2024-11-17 00:33:02,292 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L619: havoc ldv_dev_get_drvdata_#t~mem29#1.base, ldv_dev_get_drvdata_#t~mem29#1.offset; [2024-11-17 00:33:02,292 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L774: havoc ldv_i2c_get_clientdata_#t~ret42#1.base, ldv_i2c_get_clientdata_#t~ret42#1.offset; [2024-11-17 00:33:02,292 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L842: call ULTIMATE.dealloc(alloc_fix_12_~#chip_id~0#1.base, alloc_fix_12_~#chip_id~0#1.offset);havoc alloc_fix_12_~#chip_id~0#1.base, alloc_fix_12_~#chip_id~0#1.offset; [2024-11-17 00:33:02,378 INFO L? ?]: Removed 414 outVars from TransFormulas that were not future-live. [2024-11-17 00:33:02,379 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:33:02,396 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:33:02,399 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:33:02,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:33:02 BoogieIcfgContainer [2024-11-17 00:33:02,399 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:33:02,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:33:02,402 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:33:02,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:33:02,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:33:00" (1/3) ... [2024-11-17 00:33:02,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fbe235a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:33:02, skipping insertion in model container [2024-11-17 00:33:02,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:33:00" (2/3) ... [2024-11-17 00:33:02,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fbe235a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:33:02, skipping insertion in model container [2024-11-17 00:33:02,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:33:02" (3/3) ... [2024-11-17 00:33:02,407 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test12-2.i [2024-11-17 00:33:02,419 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:33:02,419 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 124 error locations. [2024-11-17 00:33:02,463 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:33:02,472 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;@20c27131, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:33:02,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 124 error locations. [2024-11-17 00:33:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 334 states, 192 states have (on average 1.7708333333333333) internal successors, (340), 315 states have internal predecessors, (340), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-17 00:33:02,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:33:02,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:33:02,483 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:33:02,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-17 00:33:02,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:33:02,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1175154924, now seen corresponding path program 1 times [2024-11-17 00:33:02,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:33:02,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314966109] [2024-11-17 00:33:02,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:33:02,498 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-17 00:33:02,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:33:02,501 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-17 00:33:02,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-17 00:33:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:33:02,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:33:02,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:33:02,641 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-17 00:33:02,642 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:33:02,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:33:02,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1314966109] [2024-11-17 00:33:02,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1314966109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:33:02,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:33:02,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:33:02,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844649486] [2024-11-17 00:33:02,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:33:02,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:33:02,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:33:02,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:33:02,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:33:02,674 INFO L87 Difference]: Start difference. First operand has 334 states, 192 states have (on average 1.7708333333333333) internal successors, (340), 315 states have internal predecessors, (340), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-17 00:33:02,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:33:02,831 INFO L93 Difference]: Finished difference Result 563 states and 651 transitions. [2024-11-17 00:33:02,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:33:02,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-17 00:33:02,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:33:02,854 INFO L225 Difference]: With dead ends: 563 [2024-11-17 00:33:02,854 INFO L226 Difference]: Without dead ends: 560 [2024-11-17 00:33:02,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:33:02,859 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 231 mSDsluCounter, 1482 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 2047 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:33:02,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 2047 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:33:02,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-17 00:33:02,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 335. [2024-11-17 00:33:02,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 193 states have (on average 1.7512953367875648) internal successors, (338), 315 states have internal predecessors, (338), 15 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23) [2024-11-17 00:33:02,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 376 transitions. [2024-11-17 00:33:02,990 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 376 transitions. Word has length 11 [2024-11-17 00:33:02,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:33:02,991 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 376 transitions. [2024-11-17 00:33:02,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-17 00:33:02,991 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 376 transitions. [2024-11-17 00:33:02,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:33:02,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:33:02,992 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:33:02,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-17 00:33:03,192 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-17 00:33:03,193 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-17 00:33:03,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:33:03,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2062658605, now seen corresponding path program 1 times [2024-11-17 00:33:03,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:33:03,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666801024] [2024-11-17 00:33:03,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:33:03,194 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-17 00:33:03,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:33:03,196 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-17 00:33:03,197 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-17 00:33:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:33:03,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:33:03,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:33:03,387 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-17 00:33:03,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:33:03,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:33:03,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666801024] [2024-11-17 00:33:03,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666801024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:33:03,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:33:03,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:33:03,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263509765] [2024-11-17 00:33:03,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:33:03,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:33:03,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:33:03,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:33:03,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:33:03,389 INFO L87 Difference]: Start difference. First operand 335 states and 376 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-17 00:33:04,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:33:04,096 INFO L93 Difference]: Finished difference Result 444 states and 491 transitions. [2024-11-17 00:33:04,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:33:04,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-17 00:33:04,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:33:04,098 INFO L225 Difference]: With dead ends: 444 [2024-11-17 00:33:04,098 INFO L226 Difference]: Without dead ends: 444 [2024-11-17 00:33:04,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-17 00:33:04,099 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 315 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:33:04,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 538 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 00:33:04,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-17 00:33:04,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 370. [2024-11-17 00:33:04,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 225 states have (on average 1.7377777777777779) internal successors, (391), 346 states have internal predecessors, (391), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (27), 18 states have call predecessors, (27), 17 states have call successors, (27) [2024-11-17 00:33:04,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 435 transitions. [2024-11-17 00:33:04,118 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 435 transitions. Word has length 11 [2024-11-17 00:33:04,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:33:04,118 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 435 transitions. [2024-11-17 00:33:04,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-17 00:33:04,118 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 435 transitions. [2024-11-17 00:33:04,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:33:04,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:33:04,119 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:33:04,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-17 00:33:04,319 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-17 00:33:04,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-17 00:33:04,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:33:04,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2062658606, now seen corresponding path program 1 times [2024-11-17 00:33:04,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:33:04,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944303616] [2024-11-17 00:33:04,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:33:04,321 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-17 00:33:04,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:33:04,323 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-17 00:33:04,324 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-17 00:33:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:33:04,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:33:04,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:33:04,503 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-17 00:33:04,503 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:33:04,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:33:04,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944303616] [2024-11-17 00:33:04,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [944303616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:33:04,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:33:04,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:33:04,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242931072] [2024-11-17 00:33:04,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:33:04,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:33:04,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:33:04,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:33:04,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:33:04,505 INFO L87 Difference]: Start difference. First operand 370 states and 435 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-17 00:33:05,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:33:05,100 INFO L93 Difference]: Finished difference Result 495 states and 572 transitions. [2024-11-17 00:33:05,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:33:05,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-17 00:33:05,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:33:05,103 INFO L225 Difference]: With dead ends: 495 [2024-11-17 00:33:05,103 INFO L226 Difference]: Without dead ends: 495 [2024-11-17 00:33:05,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-17 00:33:05,107 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 145 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:33:05,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 911 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 00:33:05,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-11-17 00:33:05,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 424. [2024-11-17 00:33:05,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 273 states have (on average 1.7252747252747254) internal successors, (471), 394 states have internal predecessors, (471), 21 states have call successors, (21), 9 states have call predecessors, (21), 10 states have return successors, (34), 22 states have call predecessors, (34), 21 states have call successors, (34) [2024-11-17 00:33:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 526 transitions. [2024-11-17 00:33:05,120 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 526 transitions. Word has length 11 [2024-11-17 00:33:05,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:33:05,120 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 526 transitions. [2024-11-17 00:33:05,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-17 00:33:05,121 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 526 transitions. [2024-11-17 00:33:05,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 00:33:05,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:33:05,121 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:33:05,129 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-17 00:33:05,322 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-17 00:33:05,322 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-17 00:33:05,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:33:05,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2059969046, now seen corresponding path program 1 times [2024-11-17 00:33:05,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:33:05,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1529921424] [2024-11-17 00:33:05,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:33:05,323 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-17 00:33:05,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:33:05,324 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-17 00:33:05,325 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-17 00:33:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:33:05,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 00:33:05,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:33:05,518 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-17 00:33:05,519 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:33:05,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:33:05,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1529921424] [2024-11-17 00:33:05,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1529921424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:33:05,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:33:05,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:33:05,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866679234] [2024-11-17 00:33:05,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:33:05,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:33:05,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:33:05,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:33:05,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:33:05,521 INFO L87 Difference]: Start difference. First operand 424 states and 526 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-17 00:33:06,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:33:06,289 INFO L93 Difference]: Finished difference Result 474 states and 579 transitions. [2024-11-17 00:33:06,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:33:06,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2024-11-17 00:33:06,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:33:06,292 INFO L225 Difference]: With dead ends: 474 [2024-11-17 00:33:06,292 INFO L226 Difference]: Without dead ends: 474 [2024-11-17 00:33:06,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:33:06,293 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 60 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:33:06,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1215 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 00:33:06,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-11-17 00:33:06,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 436. [2024-11-17 00:33:06,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 282 states have (on average 1.7127659574468086) internal successors, (483), 404 states have internal predecessors, (483), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (34), 22 states have call predecessors, (34), 21 states have call successors, (34) [2024-11-17 00:33:06,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 538 transitions. [2024-11-17 00:33:06,308 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 538 transitions. Word has length 13 [2024-11-17 00:33:06,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:33:06,309 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 538 transitions. [2024-11-17 00:33:06,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-17 00:33:06,309 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 538 transitions. [2024-11-17 00:33:06,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 00:33:06,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:33:06,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:33:06,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-17 00:33:06,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:33:06,510 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-17 00:33:06,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:33:06,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2059969045, now seen corresponding path program 1 times [2024-11-17 00:33:06,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:33:06,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263425836] [2024-11-17 00:33:06,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:33:06,512 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-17 00:33:06,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:33:06,513 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:33:06,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-17 00:33:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:33:06,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 00:33:06,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:33:06,763 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-17 00:33:06,763 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:33:06,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:33:06,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263425836] [2024-11-17 00:33:06,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263425836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:33:06,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:33:06,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:33:06,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467976939] [2024-11-17 00:33:06,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:33:06,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:33:06,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:33:06,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:33:06,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:33:06,765 INFO L87 Difference]: Start difference. First operand 436 states and 538 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-17 00:33:07,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:33:07,812 INFO L93 Difference]: Finished difference Result 460 states and 558 transitions. [2024-11-17 00:33:07,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:33:07,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2024-11-17 00:33:07,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:33:07,814 INFO L225 Difference]: With dead ends: 460 [2024-11-17 00:33:07,815 INFO L226 Difference]: Without dead ends: 460 [2024-11-17 00:33:07,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:33:07,815 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 34 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:33:07,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1419 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-17 00:33:07,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-17 00:33:07,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 448. [2024-11-17 00:33:07,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 294 states have (on average 1.6972789115646258) internal successors, (499), 416 states have internal predecessors, (499), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (34), 22 states have call predecessors, (34), 21 states have call successors, (34) [2024-11-17 00:33:07,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 554 transitions. [2024-11-17 00:33:07,844 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 554 transitions. Word has length 13 [2024-11-17 00:33:07,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:33:07,844 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 554 transitions. [2024-11-17 00:33:07,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-17 00:33:07,844 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 554 transitions. [2024-11-17 00:33:07,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 00:33:07,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:33:07,847 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:33:07,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-17 00:33:08,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:33:08,049 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-17 00:33:08,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:33:08,050 INFO L85 PathProgramCache]: Analyzing trace with hash -2074919923, now seen corresponding path program 1 times [2024-11-17 00:33:08,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:33:08,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725964842] [2024-11-17 00:33:08,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:33:08,050 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-17 00:33:08,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:33:08,051 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-17 00:33:08,052 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-17 00:33:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:33:08,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 00:33:08,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:33:08,129 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-17 00:33:08,167 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |ldv_malloc_#res.base| (select |c_#valid| |ldv_malloc_#res.base|)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-17 00:33:08,200 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-17 00:33:08,201 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-17 00:33:08,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-17 00:33:08,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:33:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:33:12,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:33:12,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725964842] [2024-11-17 00:33:12,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725964842] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:33:12,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:33:12,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-17 00:33:12,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323355571] [2024-11-17 00:33:12,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:33:12,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:33:12,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:33:12,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:33:12,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=40, Unknown=2, NotChecked=12, Total=72 [2024-11-17 00:33:12,375 INFO L87 Difference]: Start difference. First operand 448 states and 554 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:33:13,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:33:13,603 INFO L93 Difference]: Finished difference Result 507 states and 617 transitions. [2024-11-17 00:33:13,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:33:13,604 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2024-11-17 00:33:13,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:33:13,607 INFO L225 Difference]: With dead ends: 507 [2024-11-17 00:33:13,607 INFO L226 Difference]: Without dead ends: 507 [2024-11-17 00:33:13,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=23, Invalid=51, Unknown=2, NotChecked=14, Total=90 [2024-11-17 00:33:13,610 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 203 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 436 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:33:13,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1078 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 897 Invalid, 0 Unknown, 436 Unchecked, 1.2s Time] [2024-11-17 00:33:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2024-11-17 00:33:13,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 455. [2024-11-17 00:33:13,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 302 states have (on average 1.6821192052980132) internal successors, (508), 422 states have internal predecessors, (508), 21 states have call successors, (21), 11 states have call predecessors, (21), 14 states have return successors, (35), 23 states have call predecessors, (35), 21 states have call successors, (35) [2024-11-17 00:33:13,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 564 transitions. [2024-11-17 00:33:13,625 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 564 transitions. Word has length 17 [2024-11-17 00:33:13,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:33:13,625 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 564 transitions. [2024-11-17 00:33:13,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:33:13,626 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 564 transitions. [2024-11-17 00:33:13,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 00:33:13,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:33:13,628 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:33:13,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-17 00:33:13,828 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-17 00:33:13,829 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-17 00:33:13,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:33:13,829 INFO L85 PathProgramCache]: Analyzing trace with hash -2074919922, now seen corresponding path program 1 times [2024-11-17 00:33:13,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:33:13,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1886741281] [2024-11-17 00:33:13,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:33:13,830 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-17 00:33:13,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:33:13,831 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-17 00:33:13,832 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-17 00:33:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:33:13,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-17 00:33:13,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:33:13,907 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-17 00:33:13,919 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-17 00:33:14,000 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-17 00:33:14,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:33:14,021 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-17 00:33:14,030 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 00:33:14,030 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-17 00:33:14,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-17 00:33:14,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:33:14,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:33:14,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1886741281] [2024-11-17 00:33:14,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1886741281] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:33:14,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [495746121] [2024-11-17 00:33:14,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:33:14,178 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-17 00:33:14,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-17 00:33:14,180 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-17 00:33:14,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-17 00:33:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:33:14,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-17 00:33:14,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:33:14,289 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-17 00:33:14,294 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-17 00:33:14,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:33:14,375 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-17 00:33:14,382 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 00:33:14,383 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-17 00:33:14,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-17 00:33:14,392 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:33:18,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [495746121] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:33:18,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:33:18,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-17 00:33:18,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461099419] [2024-11-17 00:33:18,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:33:18,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:33:18,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:33:18,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:33:18,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-11-17 00:33:18,494 INFO L87 Difference]: Start difference. First operand 455 states and 564 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:33:21,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:33:21,082 INFO L93 Difference]: Finished difference Result 800 states and 976 transitions. [2024-11-17 00:33:21,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:33:21,083 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-11-17 00:33:21,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:33:21,085 INFO L225 Difference]: With dead ends: 800 [2024-11-17 00:33:21,085 INFO L226 Difference]: Without dead ends: 800 [2024-11-17 00:33:21,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=30, Invalid=105, Unknown=1, NotChecked=20, Total=156 [2024-11-17 00:33:21,086 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 381 mSDsluCounter, 1821 mSDsCounter, 0 mSdLazyCounter, 2102 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 2327 SdHoareTripleChecker+Invalid, 2929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 782 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:33:21,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 2327 Invalid, 2929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2102 Invalid, 0 Unknown, 782 Unchecked, 2.5s Time] [2024-11-17 00:33:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-17 00:33:21,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 633. [2024-11-17 00:33:21,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 466 states have (on average 1.701716738197425) internal successors, (793), 583 states have internal predecessors, (793), 40 states have call successors, (40), 11 states have call predecessors, (40), 14 states have return successors, (64), 43 states have call predecessors, (64), 40 states have call successors, (64) [2024-11-17 00:33:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 897 transitions. [2024-11-17 00:33:21,098 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 897 transitions. Word has length 17 [2024-11-17 00:33:21,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:33:21,099 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 897 transitions. [2024-11-17 00:33:21,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:33:21,099 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 897 transitions. [2024-11-17 00:33:21,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 00:33:21,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:33:21,100 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:33:21,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-17 00:33:21,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-17 00:33:21,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-17 00:33:21,501 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-17 00:33:21,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:33:21,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1926644366, now seen corresponding path program 1 times [2024-11-17 00:33:21,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:33:21,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431098969] [2024-11-17 00:33:21,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:33:21,502 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-17 00:33:21,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:33:21,503 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-17 00:33:21,503 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-17 00:33:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:33:21,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:33:21,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:33:21,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:33:21,597 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:33:21,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:33:21,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431098969] [2024-11-17 00:33:21,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431098969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:33:21,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:33:21,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:33:21,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84892460] [2024-11-17 00:33:21,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:33:21,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:33:21,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:33:21,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:33:21,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:33:21,598 INFO L87 Difference]: Start difference. First operand 633 states and 897 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:33:21,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:33:21,641 INFO L93 Difference]: Finished difference Result 544 states and 742 transitions. [2024-11-17 00:33:21,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:33:21,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-11-17 00:33:21,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:33:21,643 INFO L225 Difference]: With dead ends: 544 [2024-11-17 00:33:21,643 INFO L226 Difference]: Without dead ends: 544 [2024-11-17 00:33:21,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:33:21,644 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 0 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:33:21,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1447 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:33:21,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-11-17 00:33:21,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2024-11-17 00:33:21,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 388 states have (on average 1.6958762886597938) internal successors, (658), 503 states have internal predecessors, (658), 33 states have call successors, (33), 9 states have call predecessors, (33), 12 states have return successors, (51), 36 states have call predecessors, (51), 33 states have call successors, (51) [2024-11-17 00:33:21,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 742 transitions. [2024-11-17 00:33:21,656 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 742 transitions. Word has length 17 [2024-11-17 00:33:21,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:33:21,656 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 742 transitions. [2024-11-17 00:33:21,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:33:21,656 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 742 transitions. [2024-11-17 00:33:21,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 00:33:21,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:33:21,657 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:33:21,660 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-17 00:33:21,857 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-17 00:33:21,857 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-17 00:33:21,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:33:21,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1133514986, now seen corresponding path program 1 times [2024-11-17 00:33:21,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:33:21,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034513066] [2024-11-17 00:33:21,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:33:21,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:33:21,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:33:21,861 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-17 00:33:21,861 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-17 00:33:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:33:21,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:33:21,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:33:21,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:33:21,933 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:33:21,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:33:21,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034513066] [2024-11-17 00:33:21,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034513066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:33:21,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:33:21,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:33:21,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250996835] [2024-11-17 00:33:21,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:33:21,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:33:21,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:33:21,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:33:21,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:33:21,935 INFO L87 Difference]: Start difference. First operand 544 states and 742 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-17 00:33:21,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:33:21,999 INFO L93 Difference]: Finished difference Result 937 states and 1332 transitions. [2024-11-17 00:33:21,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:33:21,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 19 [2024-11-17 00:33:21,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:33:22,002 INFO L225 Difference]: With dead ends: 937 [2024-11-17 00:33:22,002 INFO L226 Difference]: Without dead ends: 937 [2024-11-17 00:33:22,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:33:22,003 INFO L432 NwaCegarLoop]: 601 mSDtfsCounter, 220 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 2157 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.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:33:22,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 2157 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:33:22,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2024-11-17 00:33:22,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 546. [2024-11-17 00:33:22,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 390 states have (on average 1.6923076923076923) internal successors, (660), 504 states have internal predecessors, (660), 33 states have call successors, (33), 9 states have call predecessors, (33), 12 states have return successors, (51), 37 states have call predecessors, (51), 33 states have call successors, (51) [2024-11-17 00:33:22,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 744 transitions. [2024-11-17 00:33:22,020 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 744 transitions. Word has length 19 [2024-11-17 00:33:22,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:33:22,020 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 744 transitions. [2024-11-17 00:33:22,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-17 00:33:22,020 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 744 transitions. [2024-11-17 00:33:22,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 00:33:22,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:33:22,020 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:33:22,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-17 00:33:22,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:33:22,221 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-17 00:33:22,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:33:22,222 INFO L85 PathProgramCache]: Analyzing trace with hash 609295349, now seen corresponding path program 1 times [2024-11-17 00:33:22,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:33:22,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204503234] [2024-11-17 00:33:22,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:33:22,222 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-17 00:33:22,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:33:22,223 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:33:22,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-17 00:33:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:33:22,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:33:22,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:33:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:33:22,386 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:33:22,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:33:22,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:33:22,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204503234] [2024-11-17 00:33:22,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204503234] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:33:22,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:33:22,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-11-17 00:33:22,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701976886] [2024-11-17 00:33:22,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:33:22,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 00:33:22,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:33:22,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 00:33:22,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:33:22,447 INFO L87 Difference]: Start difference. First operand 546 states and 744 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 00:33:22,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:33:22,843 INFO L93 Difference]: Finished difference Result 550 states and 746 transitions. [2024-11-17 00:33:22,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:33:22,844 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 19 [2024-11-17 00:33:22,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:33:22,846 INFO L225 Difference]: With dead ends: 550 [2024-11-17 00:33:22,846 INFO L226 Difference]: Without dead ends: 550 [2024-11-17 00:33:22,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:33:22,847 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 411 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:33:22,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1762 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:33:22,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-17 00:33:22,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 545. [2024-11-17 00:33:22,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 390 states have (on average 1.6871794871794872) internal successors, (658), 503 states have internal predecessors, (658), 33 states have call successors, (33), 9 states have call predecessors, (33), 12 states have return successors, (51), 37 states have call predecessors, (51), 33 states have call successors, (51) [2024-11-17 00:33:22,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 742 transitions. [2024-11-17 00:33:22,856 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 742 transitions. Word has length 19 [2024-11-17 00:33:22,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:33:22,856 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 742 transitions. [2024-11-17 00:33:22,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 00:33:22,857 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 742 transitions. [2024-11-17 00:33:22,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 00:33:22,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:33:22,857 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:33:22,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-17 00:33:23,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:33:23,058 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ldv_msg_freeErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-17 00:33:23,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:33:23,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1050990605, now seen corresponding path program 1 times [2024-11-17 00:33:23,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:33:23,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478593638] [2024-11-17 00:33:23,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:33:23,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-17 00:33:23,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:33:23,061 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-17 00:33:23,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 (13)] Waiting until timeout for monitored process [2024-11-17 00:33:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:33:23,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:33:23,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:33:23,147 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-17 00:33:23,147 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:33:23,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:33:23,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478593638] [2024-11-17 00:33:23,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478593638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:33:23,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:33:23,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:33:23,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978050650] [2024-11-17 00:33:23,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:33:23,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:33:23,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:33:23,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:33:23,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:33:23,148 INFO L87 Difference]: Start difference. First operand 545 states and 742 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-17 00:33:23,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:33:23,688 INFO L93 Difference]: Finished difference Result 549 states and 745 transitions. [2024-11-17 00:33:23,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:33:23,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 20 [2024-11-17 00:33:23,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:33:23,691 INFO L225 Difference]: With dead ends: 549 [2024-11-17 00:33:23,691 INFO L226 Difference]: Without dead ends: 534 [2024-11-17 00:33:23,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:33:23,691 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 43 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:33:23,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 726 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 00:33:23,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-17 00:33:23,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2024-11-17 00:33:23,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 380 states have (on average 1.7026315789473685) internal successors, (647), 493 states have internal predecessors, (647), 33 states have call successors, (33), 9 states have call predecessors, (33), 11 states have return successors, (50), 36 states have call predecessors, (50), 33 states have call successors, (50) [2024-11-17 00:33:23,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 730 transitions. [2024-11-17 00:33:23,704 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 730 transitions. Word has length 20 [2024-11-17 00:33:23,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:33:23,705 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 730 transitions. [2024-11-17 00:33:23,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-17 00:33:23,705 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 730 transitions. [2024-11-17 00:33:23,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:33:23,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:33:23,705 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:33:23,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-17 00:33:23,905 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-17 00:33:23,906 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-17 00:33:23,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:33:23,906 INFO L85 PathProgramCache]: Analyzing trace with hash 502053105, now seen corresponding path program 1 times [2024-11-17 00:33:23,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:33:23,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152469601] [2024-11-17 00:33:23,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:33:23,907 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-17 00:33:23,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:33:23,908 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-17 00:33:23,908 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-17 00:33:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:33:23,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 00:33:23,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:33:24,030 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-17 00:33:24,031 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-17 00:33:24,144 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 16 treesize of output 13 [2024-11-17 00:33:24,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:33:24,149 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:33:24,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:33:24,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152469601] [2024-11-17 00:33:24,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152469601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:33:24,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1807420334] [2024-11-17 00:33:24,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:33:24,209 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-17 00:33:24,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-17 00:33:24,211 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-17 00:33:24,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-11-17 00:33:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:33:24,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 00:33:24,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:33:24,357 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-17 00:33:24,358 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-17 00:33:24,431 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 16 treesize of output 13 [2024-11-17 00:33:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:33:24,437 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:33:24,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1807420334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:33:24,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:33:24,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-17 00:33:24,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269610969] [2024-11-17 00:33:24,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:33:24,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:33:24,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:33:24,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:33:24,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:33:24,487 INFO L87 Difference]: Start difference. First operand 534 states and 730 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:33:26,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:33:26,012 INFO L93 Difference]: Finished difference Result 640 states and 843 transitions. [2024-11-17 00:33:26,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:33:26,012 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-17 00:33:26,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:33:26,014 INFO L225 Difference]: With dead ends: 640 [2024-11-17 00:33:26,014 INFO L226 Difference]: Without dead ends: 640 [2024-11-17 00:33:26,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:33:26,015 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 281 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:33:26,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 978 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-17 00:33:26,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-11-17 00:33:26,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 537. [2024-11-17 00:33:26,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 383 states have (on average 1.6997389033942558) internal successors, (651), 496 states have internal predecessors, (651), 33 states have call successors, (33), 9 states have call predecessors, (33), 11 states have return successors, (50), 36 states have call predecessors, (50), 33 states have call successors, (50) [2024-11-17 00:33:26,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 734 transitions. [2024-11-17 00:33:26,024 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 734 transitions. Word has length 23 [2024-11-17 00:33:26,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:33:26,024 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 734 transitions. [2024-11-17 00:33:26,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:33:26,024 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 734 transitions. [2024-11-17 00:33:26,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:33:26,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:33:26,025 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:33:26,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2024-11-17 00:33:26,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-17 00:33:26,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-17 00:33:26,426 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-17 00:33:26,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:33:26,426 INFO L85 PathProgramCache]: Analyzing trace with hash 502053106, now seen corresponding path program 1 times [2024-11-17 00:33:26,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:33:26,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367422753] [2024-11-17 00:33:26,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:33:26,427 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-17 00:33:26,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:33:26,428 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-17 00:33:26,428 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-17 00:33:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:33:26,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 00:33:26,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:33:26,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:33:26,585 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-17 00:33:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:33:26,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:33:30,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:33:30,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367422753] [2024-11-17 00:33:30,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367422753] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:33:30,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [278813520] [2024-11-17 00:33:30,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:33:30,928 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-17 00:33:30,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-17 00:33:30,929 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-17 00:33:30,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-17 00:33:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:33:31,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 00:33:31,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:33:31,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:33:31,090 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-17 00:33:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:33:31,171 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:33:31,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [278813520] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:33:31,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:33:31,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-17 00:33:31,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773630502] [2024-11-17 00:33:31,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:33:31,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:33:31,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:33:31,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:33:31,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=62, Unknown=1, NotChecked=0, Total=90 [2024-11-17 00:33:31,350 INFO L87 Difference]: Start difference. First operand 537 states and 734 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:33:35,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:33:39,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:33:43,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:33:48,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:33:52,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:33:57,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:34:01,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:34:01,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:34:01,774 INFO L93 Difference]: Finished difference Result 633 states and 836 transitions. [2024-11-17 00:34:01,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:34:01,775 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-17 00:34:01,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:34:01,777 INFO L225 Difference]: With dead ends: 633 [2024-11-17 00:34:01,777 INFO L226 Difference]: Without dead ends: 633 [2024-11-17 00:34:01,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=85, Invalid=154, Unknown=1, NotChecked=0, Total=240 [2024-11-17 00:34:01,777 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 741 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 89 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:34:01,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 661 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 838 Invalid, 7 Unknown, 0 Unchecked, 30.3s Time] [2024-11-17 00:34:01,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-17 00:34:01,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 536. [2024-11-17 00:34:01,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 383 states have (on average 1.6945169712793733) internal successors, (649), 495 states have internal predecessors, (649), 33 states have call successors, (33), 9 states have call predecessors, (33), 11 states have return successors, (50), 36 states have call predecessors, (50), 33 states have call successors, (50) [2024-11-17 00:34:01,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 732 transitions. [2024-11-17 00:34:01,786 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 732 transitions. Word has length 23 [2024-11-17 00:34:01,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:34:01,786 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 732 transitions. [2024-11-17 00:34:01,786 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:34:01,786 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 732 transitions. [2024-11-17 00:34:01,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:34:01,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:34:01,787 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:34:01,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-17 00:34:01,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2024-11-17 00:34:02,187 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,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-17 00:34:02,187 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-17 00:34:02,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:34:02,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1336308326, now seen corresponding path program 1 times [2024-11-17 00:34:02,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:34:02,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [375708156] [2024-11-17 00:34:02,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:34:02,188 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-17 00:34:02,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:34:02,189 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:34:02,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-17 00:34:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:34:02,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 00:34:02,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:34:02,262 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-17 00:34:02,297 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2024-11-17 00:34:02,319 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-17 00:34:02,319 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-17 00:34:02,333 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2024-11-17 00:34:02,333 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:34:02,424 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:34:02,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:34:02,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [375708156] [2024-11-17 00:34:02,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [375708156] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:34:02,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:34:02,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2024-11-17 00:34:02,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526123811] [2024-11-17 00:34:02,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:34:02,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:34:02,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:34:02,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:34:02,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2024-11-17 00:34:02,426 INFO L87 Difference]: Start difference. First operand 536 states and 732 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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-17 00:34:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:34:03,569 INFO L93 Difference]: Finished difference Result 597 states and 805 transitions. [2024-11-17 00:34:03,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:34:03,569 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 25 [2024-11-17 00:34:03,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:34:03,571 INFO L225 Difference]: With dead ends: 597 [2024-11-17 00:34:03,571 INFO L226 Difference]: Without dead ends: 597 [2024-11-17 00:34:03,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2024-11-17 00:34:03,572 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 191 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 423 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:34:03,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1140 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 897 Invalid, 0 Unknown, 423 Unchecked, 1.1s Time] [2024-11-17 00:34:03,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-11-17 00:34:03,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 548. [2024-11-17 00:34:03,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 394 states have (on average 1.6903553299492386) internal successors, (666), 505 states have internal predecessors, (666), 34 states have call successors, (34), 9 states have call predecessors, (34), 11 states have return successors, (52), 38 states have call predecessors, (52), 34 states have call successors, (52) [2024-11-17 00:34:03,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 752 transitions. [2024-11-17 00:34:03,579 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 752 transitions. Word has length 25 [2024-11-17 00:34:03,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:34:03,580 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 752 transitions. [2024-11-17 00:34:03,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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-17 00:34:03,580 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 752 transitions. [2024-11-17 00:34:03,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:34:03,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:34:03,581 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:34:03,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-17 00:34:03,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:34:03,781 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-17 00:34:03,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:34:03,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1336308327, now seen corresponding path program 1 times [2024-11-17 00:34:03,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:34:03,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119061479] [2024-11-17 00:34:03,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:34:03,782 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-17 00:34:03,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:34:03,783 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-17 00:34:03,784 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-17 00:34:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:34:03,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-17 00:34:03,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:34:03,860 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-17 00:34:03,923 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| |c_ldv_malloc_#in~size|) |c_#length|)) is different from true [2024-11-17 00:34:03,938 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 00:34:03,938 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 12 treesize of output 14 [2024-11-17 00:34:03,957 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-17 00:34:03,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:34:04,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:34:04,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119061479] [2024-11-17 00:34:04,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119061479] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:34:04,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1192399861] [2024-11-17 00:34:04,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:34:04,068 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-17 00:34:04,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-17 00:34:04,069 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-17 00:34:04,070 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-17 00:34:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:34:04,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-17 00:34:04,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:34:04,193 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-17 00:34:04,197 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-17 00:34:04,305 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-17 00:34:04,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:34:04,318 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-17 00:34:04,331 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 00:34:04,332 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-17 00:34:04,340 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-17 00:34:04,340 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:34:12,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1192399861] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:34:12,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:34:12,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-17 00:34:12,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040341829] [2024-11-17 00:34:12,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:34:12,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 00:34:12,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:34:12,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 00:34:12,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=171, Unknown=4, NotChecked=54, Total=272 [2024-11-17 00:34:12,458 INFO L87 Difference]: Start difference. First operand 548 states and 752 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-17 00:34:15,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:34:15,438 INFO L93 Difference]: Finished difference Result 889 states and 1168 transitions. [2024-11-17 00:34:15,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:34:15,439 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 25 [2024-11-17 00:34:15,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:34:15,441 INFO L225 Difference]: With dead ends: 889 [2024-11-17 00:34:15,441 INFO L226 Difference]: Without dead ends: 889 [2024-11-17 00:34:15,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=53, Invalid=222, Unknown=5, NotChecked=62, Total=342 [2024-11-17 00:34:15,442 INFO L432 NwaCegarLoop]: 510 mSDtfsCounter, 373 mSDsluCounter, 2711 mSDsCounter, 0 mSdLazyCounter, 2648 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 3221 SdHoareTripleChecker+Invalid, 4188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1504 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:34:15,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 3221 Invalid, 4188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2648 Invalid, 0 Unknown, 1504 Unchecked, 2.9s Time] [2024-11-17 00:34:15,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2024-11-17 00:34:15,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 738. [2024-11-17 00:34:15,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 569 states have (on average 1.6924428822495607) internal successors, (963), 676 states have internal predecessors, (963), 54 states have call successors, (54), 9 states have call predecessors, (54), 11 states have return successors, (83), 60 states have call predecessors, (83), 54 states have call successors, (83) [2024-11-17 00:34:15,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1100 transitions. [2024-11-17 00:34:15,453 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1100 transitions. Word has length 25 [2024-11-17 00:34:15,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:34:15,453 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 1100 transitions. [2024-11-17 00:34:15,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-17 00:34:15,453 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1100 transitions. [2024-11-17 00:34:15,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:34:15,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:34:15,454 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:34:15,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2024-11-17 00:34:15,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-17 00:34:15,854 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-17 00:34:15,855 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-17 00:34:15,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:34:15,855 INFO L85 PathProgramCache]: Analyzing trace with hash 830749701, now seen corresponding path program 1 times [2024-11-17 00:34:15,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:34:15,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697960343] [2024-11-17 00:34:15,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:34:15,856 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-17 00:34:15,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:34:15,858 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-17 00:34:15,859 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-17 00:34:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:34:15,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:34:15,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:34:15,958 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:34:15,959 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:34:15,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:34:15,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697960343] [2024-11-17 00:34:15,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697960343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:34:15,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:34:15,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:34:15,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547908374] [2024-11-17 00:34:15,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:34:15,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:34:15,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:34:15,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:34:15,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:34:15,960 INFO L87 Difference]: Start difference. First operand 738 states and 1100 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-17 00:34:15,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:34:15,992 INFO L93 Difference]: Finished difference Result 714 states and 1056 transitions. [2024-11-17 00:34:15,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:34:15,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 25 [2024-11-17 00:34:15,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:34:15,995 INFO L225 Difference]: With dead ends: 714 [2024-11-17 00:34:15,995 INFO L226 Difference]: Without dead ends: 714 [2024-11-17 00:34:15,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:34:15,995 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 0 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:34:15,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1427 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:34:15,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2024-11-17 00:34:16,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2024-11-17 00:34:16,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 552 states have (on average 1.6920289855072463) internal successors, (934), 658 states have internal predecessors, (934), 49 states have call successors, (49), 9 states have call predecessors, (49), 11 states have return successors, (73), 54 states have call predecessors, (73), 49 states have call successors, (73) [2024-11-17 00:34:16,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1056 transitions. [2024-11-17 00:34:16,006 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1056 transitions. Word has length 25 [2024-11-17 00:34:16,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:34:16,006 INFO L471 AbstractCegarLoop]: Abstraction has 714 states and 1056 transitions. [2024-11-17 00:34:16,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-17 00:34:16,007 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1056 transitions. [2024-11-17 00:34:16,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:34:16,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:34:16,007 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:34:16,010 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-17 00:34:16,207 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-17 00:34:16,208 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-17 00:34:16,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:34:16,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1436699054, now seen corresponding path program 1 times [2024-11-17 00:34:16,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:34:16,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729485336] [2024-11-17 00:34:16,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:34:16,208 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-17 00:34:16,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:34:16,209 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-17 00:34:16,210 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-17 00:34:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:34:16,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:34:16,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:34:16,320 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 15 treesize of output 7 [2024-11-17 00:34:16,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:34:16,331 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:34:16,331 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:34:16,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729485336] [2024-11-17 00:34:16,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729485336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:34:16,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:34:16,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:34:16,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579464852] [2024-11-17 00:34:16,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:34:16,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:34:16,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:34:16,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:34:16,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:34:16,332 INFO L87 Difference]: Start difference. First operand 714 states and 1056 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:34:16,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:34:16,746 INFO L93 Difference]: Finished difference Result 753 states and 1098 transitions. [2024-11-17 00:34:16,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:34:16,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-17 00:34:16,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:34:16,749 INFO L225 Difference]: With dead ends: 753 [2024-11-17 00:34:16,749 INFO L226 Difference]: Without dead ends: 753 [2024-11-17 00:34:16,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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-17 00:34:16,749 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 54 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:34:16,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1094 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:34:16,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-11-17 00:34:16,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 716. [2024-11-17 00:34:16,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 554 states have (on average 1.6913357400722022) internal successors, (937), 660 states have internal predecessors, (937), 49 states have call successors, (49), 9 states have call predecessors, (49), 11 states have return successors, (73), 54 states have call predecessors, (73), 49 states have call successors, (73) [2024-11-17 00:34:16,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1059 transitions. [2024-11-17 00:34:16,762 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1059 transitions. Word has length 25 [2024-11-17 00:34:16,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:34:16,763 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 1059 transitions. [2024-11-17 00:34:16,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:34:16,763 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1059 transitions. [2024-11-17 00:34:16,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:34:16,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:34:16,763 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:34:16,767 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-17 00:34:16,965 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-17 00:34:16,966 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-17 00:34:16,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:34:16,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1436699055, now seen corresponding path program 1 times [2024-11-17 00:34:16,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:34:16,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011546811] [2024-11-17 00:34:16,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:34:16,967 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-17 00:34:16,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:34:16,968 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-17 00:34:16,968 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-17 00:34:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:34:17,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 00:34:17,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:34:17,155 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 15 treesize of output 7 [2024-11-17 00:34:17,159 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-17 00:34:17,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:34:17,175 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:34:17,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:34:17,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011546811] [2024-11-17 00:34:17,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011546811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:34:17,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:34:17,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:34:17,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062551319] [2024-11-17 00:34:17,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:34:17,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:34:17,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:34:17,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:34:17,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:34:17,176 INFO L87 Difference]: Start difference. First operand 716 states and 1059 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:34:17,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:34:17,736 INFO L93 Difference]: Finished difference Result 741 states and 1085 transitions. [2024-11-17 00:34:17,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:34:17,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-17 00:34:17,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:34:17,739 INFO L225 Difference]: With dead ends: 741 [2024-11-17 00:34:17,739 INFO L226 Difference]: Without dead ends: 741 [2024-11-17 00:34:17,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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-17 00:34:17,740 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 40 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:34:17,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1152 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 00:34:17,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2024-11-17 00:34:17,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 716. [2024-11-17 00:34:17,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 554 states have (on average 1.6895306859205776) internal successors, (936), 660 states have internal predecessors, (936), 49 states have call successors, (49), 9 states have call predecessors, (49), 11 states have return successors, (73), 54 states have call predecessors, (73), 49 states have call successors, (73) [2024-11-17 00:34:17,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1058 transitions. [2024-11-17 00:34:17,752 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1058 transitions. Word has length 25 [2024-11-17 00:34:17,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:34:17,753 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 1058 transitions. [2024-11-17 00:34:17,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:34:17,753 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1058 transitions. [2024-11-17 00:34:17,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 00:34:17,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:34:17,754 INFO L215 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-17 00:34:17,757 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-17 00:34:17,954 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-17 00:34:17,955 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-17 00:34:17,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:34:17,955 INFO L85 PathProgramCache]: Analyzing trace with hash -3198913, now seen corresponding path program 1 times [2024-11-17 00:34:17,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:34:17,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206892123] [2024-11-17 00:34:17,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:34:17,956 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-17 00:34:17,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:34:17,957 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-17 00:34:17,957 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-17 00:34:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:34:18,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:34:18,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:34:18,052 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-17 00:34:18,052 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:34:18,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:34:18,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206892123] [2024-11-17 00:34:18,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206892123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:34:18,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:34:18,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:34:18,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106683291] [2024-11-17 00:34:18,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:34:18,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:34:18,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:34:18,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:34:18,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:34:18,055 INFO L87 Difference]: Start difference. First operand 716 states and 1058 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-17 00:34:18,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:34:18,097 INFO L93 Difference]: Finished difference Result 1224 states and 1873 transitions. [2024-11-17 00:34:18,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:34:18,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-17 00:34:18,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:34:18,101 INFO L225 Difference]: With dead ends: 1224 [2024-11-17 00:34:18,101 INFO L226 Difference]: Without dead ends: 1224 [2024-11-17 00:34:18,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:34:18,102 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 208 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 2017 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:34:18,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 2017 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:34:18,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2024-11-17 00:34:18,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 716. [2024-11-17 00:34:18,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 554 states have (on average 1.687725631768953) internal successors, (935), 660 states have internal predecessors, (935), 49 states have call successors, (49), 9 states have call predecessors, (49), 11 states have return successors, (73), 54 states have call predecessors, (73), 49 states have call successors, (73) [2024-11-17 00:34:18,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1057 transitions. [2024-11-17 00:34:18,122 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1057 transitions. Word has length 27 [2024-11-17 00:34:18,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:34:18,122 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 1057 transitions. [2024-11-17 00:34:18,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-17 00:34:18,123 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1057 transitions. [2024-11-17 00:34:18,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 00:34:18,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:34:18,123 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:34:18,127 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-17 00:34:18,323 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-17 00:34:18,324 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-17 00:34:18,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:34:18,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1739611422, now seen corresponding path program 1 times [2024-11-17 00:34:18,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:34:18,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576989668] [2024-11-17 00:34:18,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:34:18,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:34:18,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:34:18,327 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-17 00:34:18,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-17 00:34:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:34:18,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:34:18,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:34:18,645 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:34:18,646 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:34:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-17 00:34:18,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:34:18,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576989668] [2024-11-17 00:34:18,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [576989668] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:34:18,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:34:18,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-11-17 00:34:18,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971988764] [2024-11-17 00:34:18,710 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:34:18,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 00:34:18,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:34:18,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 00:34:18,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:34:18,711 INFO L87 Difference]: Start difference. First operand 716 states and 1057 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-17 00:34:19,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:34:19,278 INFO L93 Difference]: Finished difference Result 715 states and 1054 transitions. [2024-11-17 00:34:19,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:34:19,279 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 27 [2024-11-17 00:34:19,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:34:19,281 INFO L225 Difference]: With dead ends: 715 [2024-11-17 00:34:19,281 INFO L226 Difference]: Without dead ends: 715 [2024-11-17 00:34:19,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:34:19,281 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 836 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:34:19,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 1591 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 00:34:19,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-11-17 00:34:19,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2024-11-17 00:34:19,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 554 states have (on average 1.6823104693140793) internal successors, (932), 659 states have internal predecessors, (932), 49 states have call successors, (49), 9 states have call predecessors, (49), 11 states have return successors, (73), 54 states have call predecessors, (73), 49 states have call successors, (73) [2024-11-17 00:34:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1054 transitions. [2024-11-17 00:34:19,290 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1054 transitions. Word has length 27 [2024-11-17 00:34:19,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:34:19,290 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1054 transitions. [2024-11-17 00:34:19,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-17 00:34:19,290 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1054 transitions. [2024-11-17 00:34:19,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-17 00:34:19,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:34:19,291 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 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-17 00:34:19,294 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-17 00:34:19,491 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-17 00:34:19,491 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-17 00:34:19,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:34:19,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1022776378, now seen corresponding path program 1 times [2024-11-17 00:34:19,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:34:19,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027597999] [2024-11-17 00:34:19,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:34:19,492 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-17 00:34:19,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:34:19,493 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-17 00:34:19,494 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-17 00:34:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:34:19,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 00:34:19,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:34:19,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:34:19,788 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:34:19,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:34:19,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027597999] [2024-11-17 00:34:19,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027597999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:34:19,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:34:19,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:34:19,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911212297] [2024-11-17 00:34:19,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:34:19,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:34:19,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:34:19,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:34:19,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:34:19,789 INFO L87 Difference]: Start difference. First operand 715 states and 1054 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:34:20,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:34:20,202 INFO L93 Difference]: Finished difference Result 723 states and 1061 transitions. [2024-11-17 00:34:20,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:34:20,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-11-17 00:34:20,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:34:20,205 INFO L225 Difference]: With dead ends: 723 [2024-11-17 00:34:20,205 INFO L226 Difference]: Without dead ends: 723 [2024-11-17 00:34:20,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 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-17 00:34:20,205 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 11 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:34:20,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1326 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:34:20,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-11-17 00:34:20,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 718. [2024-11-17 00:34:20,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 557 states have (on average 1.6786355475763015) internal successors, (935), 662 states have internal predecessors, (935), 49 states have call successors, (49), 9 states have call predecessors, (49), 11 states have return successors, (73), 54 states have call predecessors, (73), 49 states have call successors, (73) [2024-11-17 00:34:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1057 transitions. [2024-11-17 00:34:20,218 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1057 transitions. Word has length 29 [2024-11-17 00:34:20,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:34:20,218 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1057 transitions. [2024-11-17 00:34:20,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:34:20,218 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1057 transitions. [2024-11-17 00:34:20,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-17 00:34:20,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:34:20,219 INFO L215 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] [2024-11-17 00:34:20,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2024-11-17 00:34:20,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:34:20,419 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-17 00:34:20,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:34:20,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1131077180, now seen corresponding path program 1 times [2024-11-17 00:34:20,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:34:20,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320144353] [2024-11-17 00:34:20,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:34:20,420 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-17 00:34:20,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:34:20,421 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:34:20,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-17 00:34:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:34:20,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-17 00:34:20,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:34:20,515 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-17 00:34:20,519 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-17 00:34:20,590 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-17 00:34:20,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:34:20,609 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-17 00:34:20,617 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 00:34:20,617 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-17 00:34:20,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:34:20,694 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-17 00:34:20,709 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-17 00:34:20,710 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-17 00:34:20,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:34:20,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-17 00:34:20,830 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-17 00:34:20,830 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-17 00:34:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 8 not checked. [2024-11-17 00:34:20,839 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:34:24,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:34:24,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320144353] [2024-11-17 00:34:24,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320144353] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:34:24,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1213621586] [2024-11-17 00:34:24,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:34:24,970 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-17 00:34:24,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-17 00:34:24,971 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-17 00:34:24,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-17 00:34:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:34:25,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-17 00:34:25,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:34:25,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 00:34:25,125 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-17 00:34:25,208 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:34:25,209 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 13 [2024-11-17 00:34:25,226 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 00:34:25,226 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-17 00:34:25,292 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |ldv_malloc_#res.base| (select |c_#valid| |ldv_malloc_#res.base|)) |c_#valid|) (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-17 00:34:25,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:34:25,322 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-17 00:34:25,338 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-17 00:34:25,339 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-17 00:34:25,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:34:25,383 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-17 00:34:25,392 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 00:34:25,392 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-17 00:34:25,401 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 10 not checked. [2024-11-17 00:34:25,401 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:34:25,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1213621586] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:34:25,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:34:25,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 13 [2024-11-17 00:34:25,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310804546] [2024-11-17 00:34:25,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:34:25,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 00:34:25,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:34:25,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 00:34:25,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=148, Unknown=3, NotChecked=50, Total=240 [2024-11-17 00:34:25,514 INFO L87 Difference]: Start difference. First operand 718 states and 1057 transitions. Second operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-17 00:34:27,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:34:31,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:34:35,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]