./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-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 1d2a98d270a821b4275b6b35f502458543f3a892fcdda158c69925a18d34f6cf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:16:29,621 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:16:29,682 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:16:29,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:16:29,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:16:29,720 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:16:29,720 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:16:29,721 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:16:29,724 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:16:29,724 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:16:29,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:16:29,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:16:29,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:16:29,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:16:29,727 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:16:29,727 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:16:29,727 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:16:29,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:16:29,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:16:29,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:16:29,729 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:16:29,733 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:16:29,733 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:16:29,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:16:29,734 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:16:29,734 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:16:29,735 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:16:29,735 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:16:29,735 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:16:29,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:16:29,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:16:29,736 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:16:29,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:16:29,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:16:29,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:16:29,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:16:29,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:16:29,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:16:29,738 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:16:29,738 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:16:29,739 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:16:29,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:16:29,739 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 -> 1d2a98d270a821b4275b6b35f502458543f3a892fcdda158c69925a18d34f6cf [2024-11-19 09:16:29,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:16:30,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:16:30,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:16:30,007 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:16:30,007 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:16:30,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-2.i [2024-11-19 09:16:31,500 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:16:31,906 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:16:31,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-2.i [2024-11-19 09:16:31,930 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8882aaba9/ff62cfa1e4b24f5a8ffa4490a7e5c8fb/FLAG419865bc8 [2024-11-19 09:16:32,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8882aaba9/ff62cfa1e4b24f5a8ffa4490a7e5c8fb [2024-11-19 09:16:32,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:16:32,085 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:16:32,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:16:32,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:16:32,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:16:32,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:16:32" (1/1) ... [2024-11-19 09:16:32,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4971dc43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:32, skipping insertion in model container [2024-11-19 09:16:32,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:16:32" (1/1) ... [2024-11-19 09:16:32,164 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:16:32,731 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:32,769 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:32,772 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:32,777 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:32,783 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:32,821 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:32,822 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:32,831 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:32,831 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:32,836 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:32,842 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:32,843 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:32,844 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:32,847 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:32,848 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:32,854 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:32,856 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:32,856 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:32,862 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:32,866 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:32,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:16:32,902 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-19 09:16:32,903 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@62b33f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:32, skipping insertion in model container [2024-11-19 09:16:32,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:16:32,904 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 09:16:32,906 INFO L158 Benchmark]: Toolchain (without parser) took 819.96ms. Allocated memory is still 153.1MB. Free memory was 120.1MB in the beginning and 93.4MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-19 09:16:32,906 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 153.1MB. Free memory was 110.9MB in the beginning and 110.8MB in the end (delta: 141.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:16:32,907 INFO L158 Benchmark]: CACSL2BoogieTranslator took 817.64ms. Allocated memory is still 153.1MB. Free memory was 120.1MB in the beginning and 93.4MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-19 09:16:32,909 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.18ms. Allocated memory is still 153.1MB. Free memory was 110.9MB in the beginning and 110.8MB in the end (delta: 141.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 817.64ms. Allocated memory is still 153.1MB. Free memory was 120.1MB in the beginning and 93.4MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1001]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-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 1d2a98d270a821b4275b6b35f502458543f3a892fcdda158c69925a18d34f6cf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:16:35,010 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:16:35,090 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:16:35,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:16:35,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:16:35,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:16:35,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:16:35,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:16:35,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:16:35,138 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:16:35,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:16:35,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:16:35,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:16:35,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:16:35,141 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:16:35,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:16:35,142 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:16:35,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:16:35,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:16:35,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:16:35,143 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:16:35,146 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:16:35,147 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:16:35,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:16:35,147 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:16:35,148 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:16:35,148 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:16:35,148 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:16:35,148 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:16:35,149 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:16:35,149 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:16:35,149 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:16:35,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:16:35,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:16:35,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:16:35,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:16:35,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:16:35,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:16:35,153 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:16:35,153 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:16:35,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:16:35,154 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:16:35,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:16:35,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:16:35,154 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 -> 1d2a98d270a821b4275b6b35f502458543f3a892fcdda158c69925a18d34f6cf [2024-11-19 09:16:35,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:16:35,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:16:35,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:16:35,528 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:16:35,528 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:16:35,529 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-2.i [2024-11-19 09:16:37,221 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:16:37,608 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:16:37,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-2.i [2024-11-19 09:16:37,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14c6ee4f2/95b5423f37e849c39ca3ff2e3cc4d329/FLAG947787098 [2024-11-19 09:16:37,659 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14c6ee4f2/95b5423f37e849c39ca3ff2e3cc4d329 [2024-11-19 09:16:37,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:16:37,663 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:16:37,664 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:16:37,665 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:16:37,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:16:37,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:16:37" (1/1) ... [2024-11-19 09:16:37,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@179eec5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:37, skipping insertion in model container [2024-11-19 09:16:37,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:16:37" (1/1) ... [2024-11-19 09:16:37,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:16:38,294 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,333 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,338 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,345 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,357 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,400 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,401 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,406 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,406 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,413 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,414 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,415 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,416 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,423 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,425 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,430 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,431 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,432 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,433 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,440 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:16:38,482 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 09:16:38,501 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:16:38,539 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,557 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,563 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,566 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,572 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,597 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,597 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,599 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,600 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,602 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,603 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,603 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,604 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,607 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,608 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,610 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,611 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,612 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,612 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,616 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:38,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:16:38,624 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:16:38,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:16:38,805 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:16:38,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:38 WrapperNode [2024-11-19 09:16:38,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:16:38,808 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:16:38,808 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:16:38,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:16:38,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:38" (1/1) ... [2024-11-19 09:16:38,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:38" (1/1) ... [2024-11-19 09:16:38,952 INFO L138 Inliner]: procedures = 286, calls = 353, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1243 [2024-11-19 09:16:38,952 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:16:38,953 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:16:38,953 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:16:38,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:16:38,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:38" (1/1) ... [2024-11-19 09:16:38,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:38" (1/1) ... [2024-11-19 09:16:38,976 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:38" (1/1) ... [2024-11-19 09:16:39,077 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [2, 12, 270, 34]. 85 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 62 writes are split as follows [0, 1, 57, 4]. [2024-11-19 09:16:39,078 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:38" (1/1) ... [2024-11-19 09:16:39,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:38" (1/1) ... [2024-11-19 09:16:39,140 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:38" (1/1) ... [2024-11-19 09:16:39,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:38" (1/1) ... [2024-11-19 09:16:39,169 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:38" (1/1) ... [2024-11-19 09:16:39,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:38" (1/1) ... [2024-11-19 09:16:39,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:16:39,195 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:16:39,195 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:16:39,196 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:16:39,196 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:38" (1/1) ... [2024-11-19 09:16:39,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:16:39,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:16:39,243 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:16:39,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:16:39,295 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-19 09:16:39,296 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-19 09:16:39,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 09:16:39,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 09:16:39,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 09:16:39,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 09:16:39,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 09:16:39,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 09:16:39,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 09:16:39,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 09:16:39,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 09:16:39,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 09:16:39,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 09:16:39,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 09:16:39,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-19 09:16:39,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 09:16:39,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 09:16:39,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 09:16:39,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 09:16:39,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 09:16:39,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:16:39,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 09:16:39,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 09:16:39,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 09:16:39,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 09:16:39,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 09:16:39,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 09:16:39,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 09:16:39,299 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-19 09:16:39,299 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-19 09:16:39,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 09:16:39,300 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 09:16:39,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:16:39,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:16:39,300 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-19 09:16:39,300 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-19 09:16:39,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:16:39,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:16:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 09:16:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-19 09:16:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-19 09:16:39,301 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-19 09:16:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:16:39,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:16:39,603 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:16:39,605 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:16:44,354 INFO L? ?]: Removed 1307 outVars from TransFormulas that were not future-live. [2024-11-19 09:16:44,355 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:16:44,403 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:16:44,407 INFO L316 CfgBuilder]: Removed 72 assume(true) statements. [2024-11-19 09:16:44,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:16:44 BoogieIcfgContainer [2024-11-19 09:16:44,408 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:16:44,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:16:44,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:16:44,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:16:44,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:16:37" (1/3) ... [2024-11-19 09:16:44,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7644ae5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:16:44, skipping insertion in model container [2024-11-19 09:16:44,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:38" (2/3) ... [2024-11-19 09:16:44,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7644ae5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:16:44, skipping insertion in model container [2024-11-19 09:16:44,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:16:44" (3/3) ... [2024-11-19 09:16:44,419 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test6-2.i [2024-11-19 09:16:44,438 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:16:44,438 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 625 error locations. [2024-11-19 09:16:44,523 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:16:44,531 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;@5de4ea8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:16:44,532 INFO L334 AbstractCegarLoop]: Starting to check reachability of 625 error locations. [2024-11-19 09:16:44,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 1284 states, 634 states have (on average 2.2145110410094637) internal successors, (1404), 1262 states have internal predecessors, (1404), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 09:16:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 09:16:44,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:44,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 09:16:44,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-19 09:16:44,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:44,563 INFO L85 PathProgramCache]: Analyzing trace with hash 85465, now seen corresponding path program 1 times [2024-11-19 09:16:44,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:44,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341787843] [2024-11-19 09:16:44,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:44,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:16:44,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:44,584 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:16:44,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 09:16:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:44,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:16:44,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:44,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:16:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:16:44,862 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:44,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:44,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341787843] [2024-11-19 09:16:44,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341787843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:44,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:44,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:16:44,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270787726] [2024-11-19 09:16:44,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:44,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:16:44,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:44,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:16:44,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:16:44,911 INFO L87 Difference]: Start difference. First operand has 1284 states, 634 states have (on average 2.2145110410094637) internal successors, (1404), 1262 states have internal predecessors, (1404), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:16:47,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:47,049 INFO L93 Difference]: Finished difference Result 1544 states and 1637 transitions. [2024-11-19 09:16:47,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:16:47,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-19 09:16:47,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:47,070 INFO L225 Difference]: With dead ends: 1544 [2024-11-19 09:16:47,071 INFO L226 Difference]: Without dead ends: 1542 [2024-11-19 09:16:47,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:16:47,076 INFO L432 NwaCegarLoop]: 911 mSDtfsCounter, 914 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:47,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 1260 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-19 09:16:47,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2024-11-19 09:16:47,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1305. [2024-11-19 09:16:47,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1305 states, 670 states have (on average 2.0791044776119403) internal successors, (1393), 1285 states have internal predecessors, (1393), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 09:16:47,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1427 transitions. [2024-11-19 09:16:47,187 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1427 transitions. Word has length 3 [2024-11-19 09:16:47,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:47,187 INFO L471 AbstractCegarLoop]: Abstraction has 1305 states and 1427 transitions. [2024-11-19 09:16:47,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:16:47,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1427 transitions. [2024-11-19 09:16:47,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 09:16:47,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:47,188 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 09:16:47,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 09:16:47,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:16:47,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-19 09:16:47,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:47,394 INFO L85 PathProgramCache]: Analyzing trace with hash 85466, now seen corresponding path program 1 times [2024-11-19 09:16:47,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:47,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511036251] [2024-11-19 09:16:47,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:47,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:16:47,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:47,398 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:16:47,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 09:16:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:47,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:16:47,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:47,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:16:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:16:47,602 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:47,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:47,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511036251] [2024-11-19 09:16:47,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511036251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:47,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:47,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:16:47,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923550062] [2024-11-19 09:16:47,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:47,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:16:47,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:47,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:16:47,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:16:47,605 INFO L87 Difference]: Start difference. First operand 1305 states and 1427 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:16:50,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:50,421 INFO L93 Difference]: Finished difference Result 1908 states and 2080 transitions. [2024-11-19 09:16:50,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:16:50,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-19 09:16:50,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:50,431 INFO L225 Difference]: With dead ends: 1908 [2024-11-19 09:16:50,432 INFO L226 Difference]: Without dead ends: 1908 [2024-11-19 09:16:50,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:16:50,434 INFO L432 NwaCegarLoop]: 1048 mSDtfsCounter, 636 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:50,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 1760 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-19 09:16:50,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2024-11-19 09:16:50,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1518. [2024-11-19 09:16:50,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 882 states have (on average 2.061224489795918) internal successors, (1818), 1496 states have internal predecessors, (1818), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 09:16:50,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1856 transitions. [2024-11-19 09:16:50,485 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1856 transitions. Word has length 3 [2024-11-19 09:16:50,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:50,485 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 1856 transitions. [2024-11-19 09:16:50,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:16:50,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1856 transitions. [2024-11-19 09:16:50,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 09:16:50,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:50,488 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:16:50,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 09:16:50,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:16:50,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-19 09:16:50,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:50,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1307350193, now seen corresponding path program 1 times [2024-11-19 09:16:50,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:50,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41770055] [2024-11-19 09:16:50,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:50,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:16:50,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:50,698 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:16:50,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 09:16:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:50,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:16:50,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:50,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:16:50,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:16:51,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:16:51,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 09:16:51,033 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:16:51,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 09:16:51,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:16:51,073 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:51,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:51,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41770055] [2024-11-19 09:16:51,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41770055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:51,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:51,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:16:51,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826127215] [2024-11-19 09:16:51,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:51,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:16:51,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:51,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:16:51,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:16:51,076 INFO L87 Difference]: Start difference. First operand 1518 states and 1856 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:16:56,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:56,079 INFO L93 Difference]: Finished difference Result 2603 states and 3022 transitions. [2024-11-19 09:16:56,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:16:56,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 09:16:56,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:56,090 INFO L225 Difference]: With dead ends: 2603 [2024-11-19 09:16:56,090 INFO L226 Difference]: Without dead ends: 2603 [2024-11-19 09:16:56,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:16:56,091 INFO L432 NwaCegarLoop]: 705 mSDtfsCounter, 1129 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 2200 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 2213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:56,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 1813 Invalid, 2213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2200 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-19 09:16:56,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2024-11-19 09:16:56,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 1667. [2024-11-19 09:16:56,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1031 states have (on average 2.0417070805043647) internal successors, (2105), 1645 states have internal predecessors, (2105), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 09:16:56,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2143 transitions. [2024-11-19 09:16:56,138 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2143 transitions. Word has length 8 [2024-11-19 09:16:56,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:56,140 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2143 transitions. [2024-11-19 09:16:56,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:16:56,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2143 transitions. [2024-11-19 09:16:56,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 09:16:56,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:56,141 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:16:56,147 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-19 09:16:56,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:16:56,343 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-19 09:16:56,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:56,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1873150296, now seen corresponding path program 1 times [2024-11-19 09:16:56,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:56,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768406080] [2024-11-19 09:16:56,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:56,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:16:56,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:56,348 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:16:56,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 09:16:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:56,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:16:56,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:56,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:16:56,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:16:56,539 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:56,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:56,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768406080] [2024-11-19 09:16:56,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768406080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:56,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:56,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:16:56,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654755813] [2024-11-19 09:16:56,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:56,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:16:56,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:56,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:16:56,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:16:56,541 INFO L87 Difference]: Start difference. First operand 1667 states and 2143 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:16:58,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:58,975 INFO L93 Difference]: Finished difference Result 2214 states and 2918 transitions. [2024-11-19 09:16:58,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:16:58,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 09:16:58,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:58,984 INFO L225 Difference]: With dead ends: 2214 [2024-11-19 09:16:58,984 INFO L226 Difference]: Without dead ends: 2214 [2024-11-19 09:16:58,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:16:58,988 INFO L432 NwaCegarLoop]: 1227 mSDtfsCounter, 924 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 1687 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 2518 SdHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:58,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 2518 Invalid, 1736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1687 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-19 09:16:58,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2024-11-19 09:16:59,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 1622. [2024-11-19 09:16:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1031 states have (on average 1.9844810863239573) internal successors, (2046), 1600 states have internal predecessors, (2046), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 09:16:59,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2084 transitions. [2024-11-19 09:16:59,040 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2084 transitions. Word has length 9 [2024-11-19 09:16:59,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:59,040 INFO L471 AbstractCegarLoop]: Abstraction has 1622 states and 2084 transitions. [2024-11-19 09:16:59,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:16:59,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2084 transitions. [2024-11-19 09:16:59,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 09:16:59,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:59,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:16:59,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-19 09:16:59,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:16:59,242 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-19 09:16:59,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:59,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1873150295, now seen corresponding path program 1 times [2024-11-19 09:16:59,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:59,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055266495] [2024-11-19 09:16:59,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:59,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:16:59,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:59,247 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:16:59,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 09:16:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:59,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:16:59,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:59,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:16:59,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:16:59,468 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:59,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:59,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055266495] [2024-11-19 09:16:59,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055266495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:59,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:59,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:16:59,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571889712] [2024-11-19 09:16:59,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:59,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:16:59,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:59,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:16:59,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:16:59,470 INFO L87 Difference]: Start difference. First operand 1622 states and 2084 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:02,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:02,273 INFO L93 Difference]: Finished difference Result 2278 states and 2940 transitions. [2024-11-19 09:17:02,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:17:02,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 09:17:02,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:02,280 INFO L225 Difference]: With dead ends: 2278 [2024-11-19 09:17:02,280 INFO L226 Difference]: Without dead ends: 2278 [2024-11-19 09:17:02,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:17:02,283 INFO L432 NwaCegarLoop]: 1403 mSDtfsCounter, 704 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 2873 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:02,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 2873 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-19 09:17:02,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2024-11-19 09:17:02,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 1614. [2024-11-19 09:17:02,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1033 states have (on average 1.9593417231364956) internal successors, (2024), 1592 states have internal predecessors, (2024), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 09:17:02,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2062 transitions. [2024-11-19 09:17:02,324 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2062 transitions. Word has length 9 [2024-11-19 09:17:02,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:02,324 INFO L471 AbstractCegarLoop]: Abstraction has 1614 states and 2062 transitions. [2024-11-19 09:17:02,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:02,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2062 transitions. [2024-11-19 09:17:02,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 09:17:02,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:02,325 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:02,331 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-19 09:17:02,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:02,526 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-19 09:17:02,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:02,527 INFO L85 PathProgramCache]: Analyzing trace with hash -325292811, now seen corresponding path program 1 times [2024-11-19 09:17:02,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:02,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372449285] [2024-11-19 09:17:02,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:02,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:02,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:02,531 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:17:02,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 09:17:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:02,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:17:02,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:02,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:02,762 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:02,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:02,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372449285] [2024-11-19 09:17:02,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372449285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:02,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:02,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:17:02,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551665536] [2024-11-19 09:17:02,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:02,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:17:02,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:02,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:17:02,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:17:02,763 INFO L87 Difference]: Start difference. First operand 1614 states and 2062 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:03,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:03,400 INFO L93 Difference]: Finished difference Result 2240 states and 2833 transitions. [2024-11-19 09:17:03,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:17:03,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-19 09:17:03,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:03,408 INFO L225 Difference]: With dead ends: 2240 [2024-11-19 09:17:03,408 INFO L226 Difference]: Without dead ends: 2240 [2024-11-19 09:17:03,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:17:03,409 INFO L432 NwaCegarLoop]: 1454 mSDtfsCounter, 640 mSDsluCounter, 2496 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 3950 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:03,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 3950 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 09:17:03,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2024-11-19 09:17:03,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 1877. [2024-11-19 09:17:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1877 states, 1293 states have (on average 1.9651972157772621) internal successors, (2541), 1852 states have internal predecessors, (2541), 24 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 09:17:03,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2585 transitions. [2024-11-19 09:17:03,452 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2585 transitions. Word has length 13 [2024-11-19 09:17:03,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:03,452 INFO L471 AbstractCegarLoop]: Abstraction has 1877 states and 2585 transitions. [2024-11-19 09:17:03,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:03,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2585 transitions. [2024-11-19 09:17:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 09:17:03,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:03,453 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:03,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 09:17:03,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:03,654 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr322REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-19 09:17:03,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:03,654 INFO L85 PathProgramCache]: Analyzing trace with hash -922136276, now seen corresponding path program 1 times [2024-11-19 09:17:03,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:03,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882150612] [2024-11-19 09:17:03,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:03,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:03,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:03,656 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:17:03,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 09:17:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:03,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:17:03,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:03,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:03,855 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:03,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:03,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882150612] [2024-11-19 09:17:03,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882150612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:03,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:03,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:17:03,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263323579] [2024-11-19 09:17:03,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:03,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:17:03,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:03,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:17:03,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:17:03,858 INFO L87 Difference]: Start difference. First operand 1877 states and 2585 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:03,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:03,884 INFO L93 Difference]: Finished difference Result 1781 states and 2413 transitions. [2024-11-19 09:17:03,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:17:03,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-19 09:17:03,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:03,890 INFO L225 Difference]: With dead ends: 1781 [2024-11-19 09:17:03,890 INFO L226 Difference]: Without dead ends: 1781 [2024-11-19 09:17:03,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:17:03,891 INFO L432 NwaCegarLoop]: 1229 mSDtfsCounter, 71 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2395 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:03,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2395 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:17:03,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2024-11-19 09:17:03,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1781. [2024-11-19 09:17:03,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1221 states have (on average 1.9402129402129402) internal successors, (2369), 1756 states have internal predecessors, (2369), 24 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 09:17:03,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2413 transitions. [2024-11-19 09:17:03,928 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2413 transitions. Word has length 13 [2024-11-19 09:17:03,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:03,929 INFO L471 AbstractCegarLoop]: Abstraction has 1781 states and 2413 transitions. [2024-11-19 09:17:03,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:03,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2413 transitions. [2024-11-19 09:17:03,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 09:17:03,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:03,931 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:03,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 09:17:04,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:04,132 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-19 09:17:04,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:04,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1177229704, now seen corresponding path program 1 times [2024-11-19 09:17:04,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:04,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759946055] [2024-11-19 09:17:04,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:04,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:04,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:04,134 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:17:04,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 09:17:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:04,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:17:04,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:04,345 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:17:04,346 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:17:04,346 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:17:04,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-19 09:17:04,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:17:04,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-19 09:17:04,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:04,409 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:04,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:04,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759946055] [2024-11-19 09:17:04,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759946055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:04,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:04,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:17:04,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724917761] [2024-11-19 09:17:04,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:04,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:17:04,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:04,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:17:04,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:17:04,412 INFO L87 Difference]: Start difference. First operand 1781 states and 2413 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:04,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:04,862 INFO L93 Difference]: Finished difference Result 2505 states and 2939 transitions. [2024-11-19 09:17:04,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:17:04,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-19 09:17:04,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:04,868 INFO L225 Difference]: With dead ends: 2505 [2024-11-19 09:17:04,868 INFO L226 Difference]: Without dead ends: 2505 [2024-11-19 09:17:04,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:17:04,869 INFO L432 NwaCegarLoop]: 1453 mSDtfsCounter, 1107 mSDsluCounter, 2643 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 4096 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:04,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 4096 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 09:17:04,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2024-11-19 09:17:04,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 1446. [2024-11-19 09:17:04,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 888 states have (on average 1.9324324324324325) internal successors, (1716), 1423 states have internal predecessors, (1716), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 09:17:04,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 1756 transitions. [2024-11-19 09:17:04,907 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 1756 transitions. Word has length 16 [2024-11-19 09:17:04,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:04,908 INFO L471 AbstractCegarLoop]: Abstraction has 1446 states and 1756 transitions. [2024-11-19 09:17:04,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:04,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1756 transitions. [2024-11-19 09:17:04,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 09:17:04,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:04,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:04,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-19 09:17:05,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:05,110 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-19 09:17:05,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:05,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1057218028, now seen corresponding path program 1 times [2024-11-19 09:17:05,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:05,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593908091] [2024-11-19 09:17:05,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:05,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:05,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:05,115 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:17:05,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 09:17:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:05,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:17:05,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:05,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:05,345 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:05,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:05,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593908091] [2024-11-19 09:17:05,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593908091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:05,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:05,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:17:05,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860015356] [2024-11-19 09:17:05,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:05,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:17:05,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:05,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:17:05,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:17:05,346 INFO L87 Difference]: Start difference. First operand 1446 states and 1756 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:05,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:05,380 INFO L93 Difference]: Finished difference Result 1386 states and 1670 transitions. [2024-11-19 09:17:05,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:17:05,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-19 09:17:05,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:05,387 INFO L225 Difference]: With dead ends: 1386 [2024-11-19 09:17:05,387 INFO L226 Difference]: Without dead ends: 1386 [2024-11-19 09:17:05,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:17:05,388 INFO L432 NwaCegarLoop]: 1186 mSDtfsCounter, 71 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2309 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:05,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2309 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:17:05,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2024-11-19 09:17:05,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1386. [2024-11-19 09:17:05,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 852 states have (on average 1.9131455399061033) internal successors, (1630), 1363 states have internal predecessors, (1630), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 09:17:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1670 transitions. [2024-11-19 09:17:05,410 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1670 transitions. Word has length 19 [2024-11-19 09:17:05,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:05,411 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 1670 transitions. [2024-11-19 09:17:05,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:05,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1670 transitions. [2024-11-19 09:17:05,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 09:17:05,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:05,411 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:05,418 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-19 09:17:05,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:05,613 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-19 09:17:05,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:05,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1920722190, now seen corresponding path program 1 times [2024-11-19 09:17:05,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:05,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486679328] [2024-11-19 09:17:05,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:05,614 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:05,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:05,621 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:17:05,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 09:17:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:05,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:17:05,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:05,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:05,849 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:05,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:05,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486679328] [2024-11-19 09:17:05,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486679328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:05,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:05,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:17:05,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471442942] [2024-11-19 09:17:05,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:05,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:17:05,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:05,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:17:05,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:17:05,850 INFO L87 Difference]: Start difference. First operand 1386 states and 1670 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:05,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:05,927 INFO L93 Difference]: Finished difference Result 1356 states and 1612 transitions. [2024-11-19 09:17:05,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:17:05,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-19 09:17:05,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:05,934 INFO L225 Difference]: With dead ends: 1356 [2024-11-19 09:17:05,934 INFO L226 Difference]: Without dead ends: 1356 [2024-11-19 09:17:05,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:17:05,935 INFO L432 NwaCegarLoop]: 1141 mSDtfsCounter, 48 mSDsluCounter, 2256 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3397 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:05,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3397 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:17:05,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2024-11-19 09:17:05,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1356. [2024-11-19 09:17:05,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 836 states have (on average 1.8803827751196172) internal successors, (1572), 1333 states have internal predecessors, (1572), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 09:17:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1612 transitions. [2024-11-19 09:17:05,959 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1612 transitions. Word has length 21 [2024-11-19 09:17:05,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:05,959 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 1612 transitions. [2024-11-19 09:17:05,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:05,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1612 transitions. [2024-11-19 09:17:05,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 09:17:05,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:05,960 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:05,967 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-19 09:17:06,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:06,161 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-19 09:17:06,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:06,161 INFO L85 PathProgramCache]: Analyzing trace with hash -956254243, now seen corresponding path program 1 times [2024-11-19 09:17:06,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:06,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903706049] [2024-11-19 09:17:06,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:06,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:06,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:06,166 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:17:06,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 09:17:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:06,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 09:17:06,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:06,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:17:06,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:06,655 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:06,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:06,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903706049] [2024-11-19 09:17:06,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903706049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:06,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:06,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:17:06,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606386440] [2024-11-19 09:17:06,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:06,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:17:06,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:06,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:17:06,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:17:06,658 INFO L87 Difference]: Start difference. First operand 1356 states and 1612 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:09,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:09,925 INFO L93 Difference]: Finished difference Result 1909 states and 2292 transitions. [2024-11-19 09:17:09,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:17:09,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-19 09:17:09,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:09,930 INFO L225 Difference]: With dead ends: 1909 [2024-11-19 09:17:09,930 INFO L226 Difference]: Without dead ends: 1909 [2024-11-19 09:17:09,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 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-19 09:17:09,931 INFO L432 NwaCegarLoop]: 1387 mSDtfsCounter, 594 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 2304 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 3658 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:09,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 3658 Invalid, 2308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2304 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-19 09:17:09,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1909 states. [2024-11-19 09:17:09,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1909 to 1352. [2024-11-19 09:17:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 836 states have (on average 1.8708133971291867) internal successors, (1564), 1329 states have internal predecessors, (1564), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 09:17:09,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1604 transitions. [2024-11-19 09:17:09,952 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1604 transitions. Word has length 35 [2024-11-19 09:17:09,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:09,953 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 1604 transitions. [2024-11-19 09:17:09,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:09,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1604 transitions. [2024-11-19 09:17:09,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 09:17:09,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:09,954 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:09,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-19 09:17:10,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:10,159 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-19 09:17:10,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:10,159 INFO L85 PathProgramCache]: Analyzing trace with hash -956254244, now seen corresponding path program 1 times [2024-11-19 09:17:10,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:10,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089411711] [2024-11-19 09:17:10,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:10,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:10,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:10,164 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:17:10,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 09:17:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:10,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:17:10,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:10,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:17:10,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:10,460 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:10,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:10,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089411711] [2024-11-19 09:17:10,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089411711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:10,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:10,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:17:10,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148479329] [2024-11-19 09:17:10,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:10,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:17:10,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:10,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:17:10,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:17:10,462 INFO L87 Difference]: Start difference. First operand 1352 states and 1604 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:12,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:12,703 INFO L93 Difference]: Finished difference Result 1778 states and 2151 transitions. [2024-11-19 09:17:12,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:17:12,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-19 09:17:12,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:12,710 INFO L225 Difference]: With dead ends: 1778 [2024-11-19 09:17:12,710 INFO L226 Difference]: Without dead ends: 1778 [2024-11-19 09:17:12,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 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-19 09:17:12,711 INFO L432 NwaCegarLoop]: 747 mSDtfsCounter, 810 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 1870 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 2287 SdHoareTripleChecker+Invalid, 1878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:12,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 2287 Invalid, 1878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1870 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-19 09:17:12,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2024-11-19 09:17:12,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1348. [2024-11-19 09:17:12,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 836 states have (on average 1.861244019138756) internal successors, (1556), 1325 states have internal predecessors, (1556), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 09:17:12,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1596 transitions. [2024-11-19 09:17:12,732 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1596 transitions. Word has length 35 [2024-11-19 09:17:12,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:12,732 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 1596 transitions. [2024-11-19 09:17:12,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:12,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1596 transitions. [2024-11-19 09:17:12,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 09:17:12,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:12,734 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:12,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-19 09:17:12,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:12,935 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-19 09:17:12,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:12,935 INFO L85 PathProgramCache]: Analyzing trace with hash 103975123, now seen corresponding path program 1 times [2024-11-19 09:17:12,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:12,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000916167] [2024-11-19 09:17:12,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:12,936 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:12,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:12,940 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:17:12,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 09:17:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:13,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:17:13,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:13,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:13,279 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:13,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:13,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000916167] [2024-11-19 09:17:13,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1000916167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:13,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:13,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:17:13,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762454558] [2024-11-19 09:17:13,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:13,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:17:13,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:13,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:17:13,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:17:13,282 INFO L87 Difference]: Start difference. First operand 1348 states and 1596 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:13,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:13,345 INFO L93 Difference]: Finished difference Result 1336 states and 1576 transitions. [2024-11-19 09:17:13,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:17:13,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-19 09:17:13,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:13,354 INFO L225 Difference]: With dead ends: 1336 [2024-11-19 09:17:13,354 INFO L226 Difference]: Without dead ends: 1336 [2024-11-19 09:17:13,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:17:13,355 INFO L432 NwaCegarLoop]: 1135 mSDtfsCounter, 21 mSDsluCounter, 2239 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3374 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:13,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3374 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:17:13,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2024-11-19 09:17:13,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1336. [2024-11-19 09:17:13,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 824 states have (on average 1.8640776699029127) internal successors, (1536), 1313 states have internal predecessors, (1536), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 09:17:13,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1576 transitions. [2024-11-19 09:17:13,376 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1576 transitions. Word has length 55 [2024-11-19 09:17:13,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:13,377 INFO L471 AbstractCegarLoop]: Abstraction has 1336 states and 1576 transitions. [2024-11-19 09:17:13,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:13,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1576 transitions. [2024-11-19 09:17:13,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 09:17:13,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:13,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:13,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-19 09:17:13,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:13,583 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-19 09:17:13,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:13,584 INFO L85 PathProgramCache]: Analyzing trace with hash -635878753, now seen corresponding path program 1 times [2024-11-19 09:17:13,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:13,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086745571] [2024-11-19 09:17:13,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:13,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:13,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:13,588 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:17:13,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-19 09:17:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:14,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 09:17:14,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:14,117 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-11-19 09:17:14,118 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 16 treesize of output 17 [2024-11-19 09:17:14,182 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-19 09:17:14,182 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 18 treesize of output 28 [2024-11-19 09:17:14,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:14,614 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:14,614 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:14,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086745571] [2024-11-19 09:17:14,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086745571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:14,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:14,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:17:14,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157724979] [2024-11-19 09:17:14,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:14,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:17:14,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:14,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:17:14,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:17:14,616 INFO L87 Difference]: Start difference. First operand 1336 states and 1576 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:18,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:18,285 INFO L93 Difference]: Finished difference Result 2445 states and 2881 transitions. [2024-11-19 09:17:18,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:17:18,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-19 09:17:18,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:18,290 INFO L225 Difference]: With dead ends: 2445 [2024-11-19 09:17:18,290 INFO L226 Difference]: Without dead ends: 2445 [2024-11-19 09:17:18,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:17:18,291 INFO L432 NwaCegarLoop]: 893 mSDtfsCounter, 1945 mSDsluCounter, 1813 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1945 SdHoareTripleChecker+Valid, 2706 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:18,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1945 Valid, 2706 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-19 09:17:18,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2024-11-19 09:17:18,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 1785. [2024-11-19 09:17:18,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1785 states, 1257 states have (on average 1.847255369928401) internal successors, (2322), 1749 states have internal predecessors, (2322), 35 states have call successors, (35), 9 states have call predecessors, (35), 7 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-19 09:17:18,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 2388 transitions. [2024-11-19 09:17:18,315 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 2388 transitions. Word has length 63 [2024-11-19 09:17:18,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:18,316 INFO L471 AbstractCegarLoop]: Abstraction has 1785 states and 2388 transitions. [2024-11-19 09:17:18,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:18,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 2388 transitions. [2024-11-19 09:17:18,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 09:17:18,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:18,317 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:18,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-19 09:17:18,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:18,518 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-19 09:17:18,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:18,518 INFO L85 PathProgramCache]: Analyzing trace with hash -635878752, now seen corresponding path program 1 times [2024-11-19 09:17:18,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:18,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238833110] [2024-11-19 09:17:18,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:18,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:18,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:18,522 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:17:18,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 09:17:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:18,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 09:17:18,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:18,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:17:18,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 09:17:19,018 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 09:17:19,018 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-19 09:17:19,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:19,583 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:19,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:19,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238833110] [2024-11-19 09:17:19,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238833110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:19,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:19,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:17:19,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696009176] [2024-11-19 09:17:19,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:19,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:17:19,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:19,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:17:19,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:17:19,585 INFO L87 Difference]: Start difference. First operand 1785 states and 2388 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:21,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:21,786 INFO L93 Difference]: Finished difference Result 1790 states and 2394 transitions. [2024-11-19 09:17:21,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:17:21,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-19 09:17:21,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:21,790 INFO L225 Difference]: With dead ends: 1790 [2024-11-19 09:17:21,790 INFO L226 Difference]: Without dead ends: 1790 [2024-11-19 09:17:21,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:17:21,791 INFO L432 NwaCegarLoop]: 1130 mSDtfsCounter, 58 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2383 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:21,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2383 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-19 09:17:21,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2024-11-19 09:17:21,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1790. [2024-11-19 09:17:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1790 states, 1261 states have (on average 1.84456780333069) internal successors, (2326), 1753 states have internal predecessors, (2326), 36 states have call successors, (36), 10 states have call predecessors, (36), 7 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 09:17:21,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 2394 transitions. [2024-11-19 09:17:21,819 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 2394 transitions. Word has length 63 [2024-11-19 09:17:21,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:21,819 INFO L471 AbstractCegarLoop]: Abstraction has 1790 states and 2394 transitions. [2024-11-19 09:17:21,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:21,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2394 transitions. [2024-11-19 09:17:21,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-19 09:17:21,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:21,820 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:21,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-19 09:17:22,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:22,021 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-19 09:17:22,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:22,022 INFO L85 PathProgramCache]: Analyzing trace with hash 735482981, now seen corresponding path program 1 times [2024-11-19 09:17:22,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:22,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279691581] [2024-11-19 09:17:22,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:22,023 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:22,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:22,024 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:17:22,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-19 09:17:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:22,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:17:22,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:22,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:22,357 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:22,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:22,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279691581] [2024-11-19 09:17:22,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279691581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:22,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:22,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:17:22,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057881081] [2024-11-19 09:17:22,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:22,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:17:22,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:22,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:17:22,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:17:22,360 INFO L87 Difference]: Start difference. First operand 1790 states and 2394 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:22,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:22,456 INFO L93 Difference]: Finished difference Result 1816 states and 2421 transitions. [2024-11-19 09:17:22,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:17:22,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-19 09:17:22,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:22,461 INFO L225 Difference]: With dead ends: 1816 [2024-11-19 09:17:22,461 INFO L226 Difference]: Without dead ends: 1816 [2024-11-19 09:17:22,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:17:22,462 INFO L432 NwaCegarLoop]: 1145 mSDtfsCounter, 15 mSDsluCounter, 4575 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 5720 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:22,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 5720 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:17:22,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2024-11-19 09:17:22,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1814. [2024-11-19 09:17:22,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1814 states, 1279 states have (on average 1.836591086786552) internal successors, (2349), 1773 states have internal predecessors, (2349), 38 states have call successors, (38), 14 states have call predecessors, (38), 11 states have return successors, (34), 30 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 09:17:22,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 2421 transitions. [2024-11-19 09:17:22,499 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 2421 transitions. Word has length 71 [2024-11-19 09:17:22,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:22,501 INFO L471 AbstractCegarLoop]: Abstraction has 1814 states and 2421 transitions. [2024-11-19 09:17:22,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:22,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2421 transitions. [2024-11-19 09:17:22,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-19 09:17:22,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:22,503 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:22,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-19 09:17:22,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:22,703 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-19 09:17:22,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:22,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1006494928, now seen corresponding path program 1 times [2024-11-19 09:17:22,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:22,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [695510524] [2024-11-19 09:17:22,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:22,705 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:22,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:22,706 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:17:22,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-19 09:17:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:23,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:17:23,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:23,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:23,164 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:23,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:23,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [695510524] [2024-11-19 09:17:23,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [695510524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:23,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:23,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:17:23,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483730980] [2024-11-19 09:17:23,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:23,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:17:23,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:23,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:17:23,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:17:23,166 INFO L87 Difference]: Start difference. First operand 1814 states and 2421 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:17:23,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:23,432 INFO L93 Difference]: Finished difference Result 1826 states and 2435 transitions. [2024-11-19 09:17:23,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:17:23,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 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 69 [2024-11-19 09:17:23,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:23,440 INFO L225 Difference]: With dead ends: 1826 [2024-11-19 09:17:23,440 INFO L226 Difference]: Without dead ends: 1826 [2024-11-19 09:17:23,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:17:23,441 INFO L432 NwaCegarLoop]: 1129 mSDtfsCounter, 22 mSDsluCounter, 4416 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 5545 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:23,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 5545 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 09:17:23,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2024-11-19 09:17:23,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1817. [2024-11-19 09:17:23,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1281 states have (on average 1.8352849336455894) internal successors, (2351), 1775 states have internal predecessors, (2351), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2024-11-19 09:17:23,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2424 transitions. [2024-11-19 09:17:23,477 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2424 transitions. Word has length 69 [2024-11-19 09:17:23,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:23,477 INFO L471 AbstractCegarLoop]: Abstraction has 1817 states and 2424 transitions. [2024-11-19 09:17:23,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:17:23,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2424 transitions. [2024-11-19 09:17:23,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-19 09:17:23,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:23,483 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:23,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-19 09:17:23,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:23,684 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-19 09:17:23,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:23,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1237454463, now seen corresponding path program 1 times [2024-11-19 09:17:23,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:23,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001393717] [2024-11-19 09:17:23,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:23,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:23,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:23,686 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:17:23,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-19 09:17:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:24,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 09:17:24,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:24,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:17:24,278 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#valid)| |alt_malloc_#res.base| (_ bv1 1)) |c_#valid|)) is different from true [2024-11-19 09:17:24,300 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-19 09:17:24,300 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-19 09:17:24,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:24,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:24,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:24,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001393717] [2024-11-19 09:17:24,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001393717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:24,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:24,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:17:24,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42614912] [2024-11-19 09:17:24,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:24,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:17:24,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:24,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:17:24,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2024-11-19 09:17:24,310 INFO L87 Difference]: Start difference. First operand 1817 states and 2424 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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-19 09:17:27,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:27,012 INFO L93 Difference]: Finished difference Result 2238 states and 2969 transitions. [2024-11-19 09:17:27,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:17:27,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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 74 [2024-11-19 09:17:27,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:27,017 INFO L225 Difference]: With dead ends: 2238 [2024-11-19 09:17:27,017 INFO L226 Difference]: Without dead ends: 2238 [2024-11-19 09:17:27,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2024-11-19 09:17:27,018 INFO L432 NwaCegarLoop]: 710 mSDtfsCounter, 771 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 3483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1538 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:27,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 2184 Invalid, 3483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1922 Invalid, 0 Unknown, 1538 Unchecked, 2.6s Time] [2024-11-19 09:17:27,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2238 states. [2024-11-19 09:17:27,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2238 to 1816. [2024-11-19 09:17:27,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1816 states, 1281 states have (on average 1.8337236533957846) internal successors, (2349), 1774 states have internal predecessors, (2349), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2024-11-19 09:17:27,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2422 transitions. [2024-11-19 09:17:27,048 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2422 transitions. Word has length 74 [2024-11-19 09:17:27,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:27,049 INFO L471 AbstractCegarLoop]: Abstraction has 1816 states and 2422 transitions. [2024-11-19 09:17:27,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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-19 09:17:27,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2422 transitions. [2024-11-19 09:17:27,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-19 09:17:27,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:27,050 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:27,063 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-19 09:17:27,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:27,251 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-19 09:17:27,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:27,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1237454464, now seen corresponding path program 1 times [2024-11-19 09:17:27,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:27,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440390443] [2024-11-19 09:17:27,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:27,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:27,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:27,256 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:17:27,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-19 09:17:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:27,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 09:17:27,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:27,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:17:27,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:17:28,151 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |alt_malloc_#res.base| (select |c_#length| |alt_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |alt_malloc_#res.base|)))) is different from true [2024-11-19 09:17:28,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:17:28,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 09:17:28,176 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:17:28,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 09:17:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:28,189 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:28,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:28,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440390443] [2024-11-19 09:17:28,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440390443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:28,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:28,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:17:28,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178320334] [2024-11-19 09:17:28,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:28,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:17:28,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:28,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:17:28,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2024-11-19 09:17:28,192 INFO L87 Difference]: Start difference. First operand 1816 states and 2422 transitions. Second operand has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-19 09:17:33,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:33,099 INFO L93 Difference]: Finished difference Result 2914 states and 3878 transitions. [2024-11-19 09:17:33,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:17:33,100 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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 74 [2024-11-19 09:17:33,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:33,104 INFO L225 Difference]: With dead ends: 2914 [2024-11-19 09:17:33,104 INFO L226 Difference]: Without dead ends: 2914 [2024-11-19 09:17:33,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2024-11-19 09:17:33,105 INFO L432 NwaCegarLoop]: 1207 mSDtfsCounter, 1477 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 3379 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 2841 SdHoareTripleChecker+Invalid, 5429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2022 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:33,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 2841 Invalid, 5429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3379 Invalid, 0 Unknown, 2022 Unchecked, 4.8s Time] [2024-11-19 09:17:33,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2024-11-19 09:17:33,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 1808. [2024-11-19 09:17:33,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1281 states have (on average 1.8212334113973458) internal successors, (2333), 1766 states have internal predecessors, (2333), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2024-11-19 09:17:33,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2406 transitions. [2024-11-19 09:17:33,132 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2406 transitions. Word has length 74 [2024-11-19 09:17:33,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:33,132 INFO L471 AbstractCegarLoop]: Abstraction has 1808 states and 2406 transitions. [2024-11-19 09:17:33,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-19 09:17:33,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2406 transitions. [2024-11-19 09:17:33,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 09:17:33,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:33,133 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:33,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-19 09:17:33,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:33,334 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-19 09:17:33,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:33,335 INFO L85 PathProgramCache]: Analyzing trace with hash -948585261, now seen corresponding path program 1 times [2024-11-19 09:17:33,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:33,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047242888] [2024-11-19 09:17:33,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:33,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:33,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:33,337 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:17:33,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-19 09:17:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:33,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 09:17:33,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:33,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:17:33,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:17:33,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 09:17:33,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:33,743 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:33,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:33,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047242888] [2024-11-19 09:17:33,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047242888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:33,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:33,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 09:17:33,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056363067] [2024-11-19 09:17:33,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:33,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 09:17:33,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:33,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 09:17:33,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:17:33,745 INFO L87 Difference]: Start difference. First operand 1808 states and 2406 transitions. Second operand has 8 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:17:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:36,956 INFO L93 Difference]: Finished difference Result 1823 states and 2422 transitions. [2024-11-19 09:17:36,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:17:36,956 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2024-11-19 09:17:36,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:36,959 INFO L225 Difference]: With dead ends: 1823 [2024-11-19 09:17:36,960 INFO L226 Difference]: Without dead ends: 1823 [2024-11-19 09:17:36,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:17:36,960 INFO L432 NwaCegarLoop]: 1132 mSDtfsCounter, 16 mSDsluCounter, 3731 mSDsCounter, 0 mSdLazyCounter, 3116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4863 SdHoareTripleChecker+Invalid, 3118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:36,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4863 Invalid, 3118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3116 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-19 09:17:36,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2024-11-19 09:17:36,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1822. [2024-11-19 09:17:36,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1293 states have (on average 1.8167053364269141) internal successors, (2349), 1778 states have internal predecessors, (2349), 38 states have call successors, (38), 16 states have call predecessors, (38), 14 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2024-11-19 09:17:36,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2422 transitions. [2024-11-19 09:17:36,987 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2422 transitions. Word has length 81 [2024-11-19 09:17:36,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:36,987 INFO L471 AbstractCegarLoop]: Abstraction has 1822 states and 2422 transitions. [2024-11-19 09:17:36,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:17:36,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2422 transitions. [2024-11-19 09:17:36,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-19 09:17:36,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:36,989 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:36,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-11-19 09:17:37,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:37,190 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-19 09:17:37,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:37,190 INFO L85 PathProgramCache]: Analyzing trace with hash 658628057, now seen corresponding path program 1 times [2024-11-19 09:17:37,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:37,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209494265] [2024-11-19 09:17:37,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:37,191 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:37,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:37,196 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:17:37,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 (22)] Waiting until timeout for monitored process [2024-11-19 09:17:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:37,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 09:17:37,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:37,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:17:37,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 09:17:37,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:17:37,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-19 09:17:37,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:37,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:37,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:37,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209494265] [2024-11-19 09:17:37,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [209494265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:37,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:37,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:17:37,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168329451] [2024-11-19 09:17:37,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:37,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:17:37,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:37,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:17:37,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:17:37,714 INFO L87 Difference]: Start difference. First operand 1822 states and 2422 transitions. Second operand has 9 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:17:41,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:41,987 INFO L93 Difference]: Finished difference Result 1822 states and 2420 transitions. [2024-11-19 09:17:41,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:17:41,988 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 82 [2024-11-19 09:17:41,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:41,991 INFO L225 Difference]: With dead ends: 1822 [2024-11-19 09:17:41,991 INFO L226 Difference]: Without dead ends: 1822 [2024-11-19 09:17:41,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:17:41,992 INFO L432 NwaCegarLoop]: 1128 mSDtfsCounter, 13 mSDsluCounter, 4710 mSDsCounter, 0 mSdLazyCounter, 3279 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 5838 SdHoareTripleChecker+Invalid, 3280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:41,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 5838 Invalid, 3280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3279 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-19 09:17:41,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2024-11-19 09:17:42,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1822. [2024-11-19 09:17:42,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1293 states have (on average 1.8151585460170148) internal successors, (2347), 1778 states have internal predecessors, (2347), 38 states have call successors, (38), 16 states have call predecessors, (38), 14 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2024-11-19 09:17:42,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2420 transitions. [2024-11-19 09:17:42,017 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2420 transitions. Word has length 82 [2024-11-19 09:17:42,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:42,018 INFO L471 AbstractCegarLoop]: Abstraction has 1822 states and 2420 transitions. [2024-11-19 09:17:42,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:17:42,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2420 transitions. [2024-11-19 09:17:42,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 09:17:42,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:42,019 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:42,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-19 09:17:42,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:42,220 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-19 09:17:42,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:42,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1486914519, now seen corresponding path program 1 times [2024-11-19 09:17:42,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:42,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825242771] [2024-11-19 09:17:42,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:42,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-19 09:17:42,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:42,225 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:17:42,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-19 09:17:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:42,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:17:42,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:42,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:42,612 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:42,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:42,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825242771] [2024-11-19 09:17:42,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [825242771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:42,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:42,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:17:42,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946030645] [2024-11-19 09:17:42,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:42,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:17:42,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:42,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:17:42,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:17:42,615 INFO L87 Difference]: Start difference. First operand 1822 states and 2420 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-19 09:17:42,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:42,679 INFO L93 Difference]: Finished difference Result 1838 states and 2438 transitions. [2024-11-19 09:17:42,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:17:42,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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 89 [2024-11-19 09:17:42,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:42,684 INFO L225 Difference]: With dead ends: 1838 [2024-11-19 09:17:42,684 INFO L226 Difference]: Without dead ends: 1832 [2024-11-19 09:17:42,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:17:42,685 INFO L432 NwaCegarLoop]: 1137 mSDtfsCounter, 3 mSDsluCounter, 3395 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4532 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:42,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4532 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:17:42,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2024-11-19 09:17:42,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1832. [2024-11-19 09:17:42,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1832 states, 1301 states have (on average 1.8116833205226748) internal successors, (2357), 1788 states have internal predecessors, (2357), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2024-11-19 09:17:42,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 2432 transitions. [2024-11-19 09:17:42,704 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 2432 transitions. Word has length 89 [2024-11-19 09:17:42,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:42,704 INFO L471 AbstractCegarLoop]: Abstraction has 1832 states and 2432 transitions. [2024-11-19 09:17:42,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-19 09:17:42,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2432 transitions. [2024-11-19 09:17:42,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-19 09:17:42,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:42,706 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:42,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-19 09:17:42,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:42,906 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-19 09:17:42,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:42,907 INFO L85 PathProgramCache]: Analyzing trace with hash 400224857, now seen corresponding path program 1 times [2024-11-19 09:17:42,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:42,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347614281] [2024-11-19 09:17:42,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:42,908 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:42,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:42,909 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:17:42,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-19 09:17:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:43,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:17:43,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:43,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:43,327 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:17:43,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:43,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:43,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347614281] [2024-11-19 09:17:43,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347614281] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:17:43,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:17:43,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-19 09:17:43,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539989798] [2024-11-19 09:17:43,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:17:43,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:17:43,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:43,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:17:43,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:17:43,426 INFO L87 Difference]: Start difference. First operand 1832 states and 2432 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 09:17:43,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:43,592 INFO L93 Difference]: Finished difference Result 1858 states and 2462 transitions. [2024-11-19 09:17:43,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:17:43,594 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 90 [2024-11-19 09:17:43,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:43,597 INFO L225 Difference]: With dead ends: 1858 [2024-11-19 09:17:43,597 INFO L226 Difference]: Without dead ends: 1846 [2024-11-19 09:17:43,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-11-19 09:17:43,598 INFO L432 NwaCegarLoop]: 1137 mSDtfsCounter, 17 mSDsluCounter, 5660 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 6797 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:43,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 6797 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:17:43,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2024-11-19 09:17:43,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1840. [2024-11-19 09:17:43,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1309 states have (on average 1.8082505729564553) internal successors, (2367), 1796 states have internal predecessors, (2367), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2024-11-19 09:17:43,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2442 transitions. [2024-11-19 09:17:43,627 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2442 transitions. Word has length 90 [2024-11-19 09:17:43,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:43,628 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2442 transitions. [2024-11-19 09:17:43,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 09:17:43,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2442 transitions. [2024-11-19 09:17:43,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 09:17:43,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:43,629 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:43,641 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 (24)] Forceful destruction successful, exit code 0 [2024-11-19 09:17:43,829 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-19 09:17:43,830 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-19 09:17:43,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:43,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1962339241, now seen corresponding path program 2 times [2024-11-19 09:17:43,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:43,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [757349547] [2024-11-19 09:17:43,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:17:43,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:43,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:43,832 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-19 09:17:43,833 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-19 09:17:44,564 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:17:44,564 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:17:44,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 09:17:44,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:44,675 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:44,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:17:45,003 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:45,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:45,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [757349547] [2024-11-19 09:17:45,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [757349547] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:17:45,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:17:45,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-19 09:17:45,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488193479] [2024-11-19 09:17:45,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:17:45,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 09:17:45,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:45,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 09:17:45,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-19 09:17:45,005 INFO L87 Difference]: Start difference. First operand 1840 states and 2442 transitions. Second operand has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 09:17:45,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:45,519 INFO L93 Difference]: Finished difference Result 1876 states and 2492 transitions. [2024-11-19 09:17:45,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 09:17:45,521 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 93 [2024-11-19 09:17:45,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:45,525 INFO L225 Difference]: With dead ends: 1876 [2024-11-19 09:17:45,525 INFO L226 Difference]: Without dead ends: 1864 [2024-11-19 09:17:45,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702 [2024-11-19 09:17:45,526 INFO L432 NwaCegarLoop]: 1137 mSDtfsCounter, 34 mSDsluCounter, 6798 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 7935 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:45,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 7935 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 09:17:45,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2024-11-19 09:17:45,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1858. [2024-11-19 09:17:45,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1327 states have (on average 1.8018085908063302) internal successors, (2391), 1814 states have internal predecessors, (2391), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2024-11-19 09:17:45,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2466 transitions. [2024-11-19 09:17:45,551 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2466 transitions. Word has length 93 [2024-11-19 09:17:45,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:45,552 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2466 transitions. [2024-11-19 09:17:45,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 09:17:45,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2466 transitions. [2024-11-19 09:17:45,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 09:17:45,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:45,553 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:45,569 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-19 09:17:45,754 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-19 09:17:45,755 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-19 09:17:45,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:45,756 INFO L85 PathProgramCache]: Analyzing trace with hash 860812567, now seen corresponding path program 3 times [2024-11-19 09:17:45,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:45,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346834938] [2024-11-19 09:17:45,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:17:45,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:45,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:45,761 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-19 09:17:45,762 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-19 09:17:46,798 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-19 09:17:46,798 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:17:46,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 09:17:46,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:46,998 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:46,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:17:47,580 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:47,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:47,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346834938] [2024-11-19 09:17:47,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346834938] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:17:47,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:17:47,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-11-19 09:17:47,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961558900] [2024-11-19 09:17:47,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:17:47,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-19 09:17:47,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:47,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 09:17:47,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2024-11-19 09:17:47,583 INFO L87 Difference]: Start difference. First operand 1858 states and 2466 transitions. Second operand has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 09:17:49,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:49,706 INFO L93 Difference]: Finished difference Result 1912 states and 2550 transitions. [2024-11-19 09:17:49,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-19 09:17:49,707 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 99 [2024-11-19 09:17:49,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:49,711 INFO L225 Difference]: With dead ends: 1912 [2024-11-19 09:17:49,711 INFO L226 Difference]: Without dead ends: 1894 [2024-11-19 09:17:49,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=854, Invalid=1696, Unknown=0, NotChecked=0, Total=2550 [2024-11-19 09:17:49,713 INFO L432 NwaCegarLoop]: 1137 mSDtfsCounter, 79 mSDsluCounter, 13597 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 14734 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:49,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 14734 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 09:17:49,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2024-11-19 09:17:49,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1894. [2024-11-19 09:17:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1363 states have (on average 1.7879677182685254) internal successors, (2437), 1850 states have internal predecessors, (2437), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2024-11-19 09:17:49,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2512 transitions. [2024-11-19 09:17:49,736 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2512 transitions. Word has length 99 [2024-11-19 09:17:49,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:49,737 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 2512 transitions. [2024-11-19 09:17:49,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 09:17:49,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2512 transitions. [2024-11-19 09:17:49,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 09:17:49,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:49,738 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:49,753 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-19 09:17:49,939 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-19 09:17:49,939 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-19 09:17:49,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:49,939 INFO L85 PathProgramCache]: Analyzing trace with hash -451672425, now seen corresponding path program 4 times [2024-11-19 09:17:49,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:49,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940892574] [2024-11-19 09:17:49,940 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:17:49,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:49,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:49,941 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-19 09:17:49,943 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-19 09:17:50,779 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:17:50,779 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:17:50,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 09:17:50,802 INFO L278 TraceCheckSpWp]: Computing forward predicates...