./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:08:22,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:08:22,969 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-17 00:08:22,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:08:22,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:08:23,006 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:08:23,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:08:23,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:08:23,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:08:23,009 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:08:23,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:08:23,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:08:23,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:08:23,013 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:08:23,014 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:08:23,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:08:23,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 00:08:23,015 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:08:23,015 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:08:23,015 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:08:23,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:08:23,019 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 00:08:23,020 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:08:23,020 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:08:23,020 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:08:23,020 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 00:08:23,021 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:08:23,021 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:08:23,021 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:08:23,021 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:08:23,021 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 00:08:23,022 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:08:23,022 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:08:23,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:08:23,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:08:23,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:08:23,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:08:23,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:08:23,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:08:23,024 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:08:23,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:08:23,024 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:08:23,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:08:23,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:08:23,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:08:23,025 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-memcleanup) ) 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-11-17 00:08:23,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:08:23,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:08:23,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:08:23,334 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:08:23,335 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:08:23,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i [2024-11-17 00:08:24,883 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:08:25,189 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:08:25,189 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i [2024-11-17 00:08:25,208 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f93f648c7/8ded36588a434ebea3d74624e41bbad4/FLAG14b21b5b9 [2024-11-17 00:08:25,469 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f93f648c7/8ded36588a434ebea3d74624e41bbad4 [2024-11-17 00:08:25,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:08:25,472 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:08:25,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:08:25,473 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:08:25,479 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:08:25,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:08:25" (1/1) ... [2024-11-17 00:08:25,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b8613a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:25, skipping insertion in model container [2024-11-17 00:08:25,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:08:25" (1/1) ... [2024-11-17 00:08:25,547 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:08:26,035 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:26,077 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:26,083 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:26,086 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:26,092 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:26,128 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:26,129 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:26,131 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:26,134 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:26,136 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:26,138 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:26,143 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:26,145 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:26,147 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:26,150 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:26,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:08:26,181 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-17 00:08:26,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@51caba8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:26, skipping insertion in model container [2024-11-17 00:08:26,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:08:26,183 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-17 00:08:26,185 INFO L158 Benchmark]: Toolchain (without parser) took 711.40ms. Allocated memory is still 153.1MB. Free memory was 80.8MB in the beginning and 114.4MB in the end (delta: -33.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-17 00:08:26,185 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 113.2MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:08:26,186 INFO L158 Benchmark]: CACSL2BoogieTranslator took 709.44ms. Allocated memory is still 153.1MB. Free memory was 80.6MB in the beginning and 114.4MB in the end (delta: -33.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-17 00:08:26,188 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.26ms. Allocated memory is still 113.2MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 709.44ms. Allocated memory is still 153.1MB. Free memory was 80.6MB in the beginning and 114.4MB in the end (delta: -33.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 831]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:08:28,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:08:28,272 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-17 00:08:28,277 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:08:28,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:08:28,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:08:28,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:08:28,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:08:28,316 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:08:28,317 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:08:28,318 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:08:28,318 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:08:28,318 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:08:28,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:08:28,319 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:08:28,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:08:28,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 00:08:28,323 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:08:28,323 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:08:28,323 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:08:28,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:08:28,328 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 00:08:28,328 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:08:28,329 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:08:28,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:08:28,329 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 00:08:28,329 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:08:28,330 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 00:08:28,330 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:08:28,330 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 00:08:28,330 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:08:28,330 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:08:28,331 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 00:08:28,331 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:08:28,331 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:08:28,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:08:28,331 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:08:28,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:08:28,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:08:28,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:08:28,332 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:08:28,333 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 00:08:28,333 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 00:08:28,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:08:28,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:08:28,334 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:08:28,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:08:28,334 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-memcleanup) ) 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-11-17 00:08:28,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:08:28,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:08:28,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:08:28,726 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:08:28,726 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:08:28,728 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i [2024-11-17 00:08:30,371 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:08:30,712 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:08:30,713 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i [2024-11-17 00:08:30,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fced972fc/4b7fa08f1ba4410fbda18822552ce0ca/FLAG84aa73bb5 [2024-11-17 00:08:30,935 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fced972fc/4b7fa08f1ba4410fbda18822552ce0ca [2024-11-17 00:08:30,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:08:30,940 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:08:30,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:08:30,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:08:30,949 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:08:30,950 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:08:30" (1/1) ... [2024-11-17 00:08:30,952 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fdca9d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:30, skipping insertion in model container [2024-11-17 00:08:30,952 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:08:30" (1/1) ... [2024-11-17 00:08:31,025 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:08:31,529 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,574 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,580 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,586 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,599 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,633 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,634 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,636 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,637 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,638 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,641 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,642 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,643 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,644 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,648 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:08:31,672 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-17 00:08:31,700 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:08:31,747 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,787 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,792 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,794 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,799 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,818 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,818 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,821 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,821 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,823 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,824 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,826 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,827 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,827 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,830 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:08:31,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:08:31,838 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:08:31,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:08:31,982 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:08:31,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:31 WrapperNode [2024-11-17 00:08:31,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:08:31,984 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:08:31,984 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:08:31,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:08:31,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:31" (1/1) ... [2024-11-17 00:08:32,040 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:31" (1/1) ... [2024-11-17 00:08:32,091 INFO L138 Inliner]: procedures = 210, calls = 273, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1005 [2024-11-17 00:08:32,091 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:08:32,092 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:08:32,092 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:08:32,092 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:08:32,115 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:31" (1/1) ... [2024-11-17 00:08:32,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:31" (1/1) ... [2024-11-17 00:08:32,132 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:31" (1/1) ... [2024-11-17 00:08:32,220 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 34, 218]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-11-17 00:08:32,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:31" (1/1) ... [2024-11-17 00:08:32,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:31" (1/1) ... [2024-11-17 00:08:32,308 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:31" (1/1) ... [2024-11-17 00:08:32,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:31" (1/1) ... [2024-11-17 00:08:32,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:31" (1/1) ... [2024-11-17 00:08:32,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:31" (1/1) ... [2024-11-17 00:08:32,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:08:32,346 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:08:32,346 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:08:32,346 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:08:32,347 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:31" (1/1) ... [2024-11-17 00:08:32,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:08:32,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:08:32,383 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 00:08:32,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 00:08:32,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-17 00:08:32,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-17 00:08:32,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-17 00:08:32,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-17 00:08:32,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-17 00:08:32,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-17 00:08:32,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-17 00:08:32,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-17 00:08:32,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-17 00:08:32,429 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-17 00:08:32,429 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-17 00:08:32,429 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-17 00:08:32,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 00:08:32,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:08:32,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:08:32,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 00:08:32,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-17 00:08:32,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-17 00:08:32,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-17 00:08:32,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:08:32,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 00:08:32,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-17 00:08:32,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-17 00:08:32,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:08:32,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:08:32,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:08:32,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:08:32,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 00:08:32,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:08:32,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:08:32,711 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:08:32,713 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:08:40,201 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-17 00:08:40,267 INFO L? ?]: Removed 134 outVars from TransFormulas that were not future-live. [2024-11-17 00:08:40,267 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:08:40,285 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:08:40,287 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:08:40,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:08:40 BoogieIcfgContainer [2024-11-17 00:08:40,288 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:08:40,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:08:40,291 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:08:40,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:08:40,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:08:30" (1/3) ... [2024-11-17 00:08:40,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27443137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:08:40, skipping insertion in model container [2024-11-17 00:08:40,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:31" (2/3) ... [2024-11-17 00:08:40,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27443137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:08:40, skipping insertion in model container [2024-11-17 00:08:40,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:08:40" (3/3) ... [2024-11-17 00:08:40,299 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test2-2.i [2024-11-17 00:08:40,316 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:08:40,316 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 00:08:40,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:08:40,377 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;@79d56bc8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:08:40,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 00:08:40,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 199 states have (on average 1.64321608040201) internal successors, (327), 201 states have internal predecessors, (327), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:08:40,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-17 00:08:40,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:08:40,391 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-17 00:08:40,392 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:08:40,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:08:40,397 INFO L85 PathProgramCache]: Analyzing trace with hash 365454364, now seen corresponding path program 1 times [2024-11-17 00:08:40,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:08:40,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589081579] [2024-11-17 00:08:40,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:08:40,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:08:40,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:08:40,411 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:08:40,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-17 00:08:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:08:40,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:08:40,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:08:40,679 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_18| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_18|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_18| (_ bv0 1)) |c_#valid|))) is different from true [2024-11-17 00:08:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:08:40,695 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:08:40,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:08:40,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589081579] [2024-11-17 00:08:40,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589081579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:08:40,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:08:40,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:08:40,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645378019] [2024-11-17 00:08:40,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:08:40,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:08:40,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:08:40,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:08:40,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-17 00:08:40,734 INFO L87 Difference]: Start difference. First operand has 206 states, 199 states have (on average 1.64321608040201) internal successors, (327), 201 states have internal predecessors, (327), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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-17 00:08:45,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:08:45,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:08:45,789 INFO L93 Difference]: Finished difference Result 307 states and 396 transitions. [2024-11-17 00:08:45,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:08:45,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-11-17 00:08:45,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:08:45,807 INFO L225 Difference]: With dead ends: 307 [2024-11-17 00:08:45,807 INFO L226 Difference]: Without dead ends: 302 [2024-11-17 00:08:45,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-17 00:08:45,812 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 128 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 397 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:08:45,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 496 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 1 Unknown, 397 Unchecked, 5.0s Time] [2024-11-17 00:08:45,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-17 00:08:45,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 202. [2024-11-17 00:08:45,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 196 states have (on average 1.2908163265306123) internal successors, (253), 197 states have internal predecessors, (253), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:08:45,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 259 transitions. [2024-11-17 00:08:45,870 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 259 transitions. Word has length 5 [2024-11-17 00:08:45,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:08:45,871 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 259 transitions. [2024-11-17 00:08:45,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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-17 00:08:45,871 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 259 transitions. [2024-11-17 00:08:45,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:08:45,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:08:45,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:08:45,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-17 00:08:46,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:08:46,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:08:46,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:08:46,075 INFO L85 PathProgramCache]: Analyzing trace with hash 3215469, now seen corresponding path program 1 times [2024-11-17 00:08:46,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:08:46,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346329781] [2024-11-17 00:08:46,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:08:46,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:08:46,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:08:46,077 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:08:46,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-17 00:08:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:08:46,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:08:46,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:08:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:08:46,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:08:46,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:08:46,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346329781] [2024-11-17 00:08:46,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346329781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:08:46,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:08:46,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:08:46,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332652503] [2024-11-17 00:08:46,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:08:46,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:08:46,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:08:46,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:08:46,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:08:46,360 INFO L87 Difference]: Start difference. First operand 202 states and 259 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-17 00:08:47,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:08:47,230 INFO L93 Difference]: Finished difference Result 328 states and 420 transitions. [2024-11-17 00:08:47,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:08:47,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2024-11-17 00:08:47,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:08:47,234 INFO L225 Difference]: With dead ends: 328 [2024-11-17 00:08:47,234 INFO L226 Difference]: Without dead ends: 328 [2024-11-17 00:08:47,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-17 00:08:47,235 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 152 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:08:47,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 479 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-17 00:08:47,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-17 00:08:47,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 293. [2024-11-17 00:08:47,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 287 states have (on average 1.2926829268292683) internal successors, (371), 288 states have internal predecessors, (371), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:08:47,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 377 transitions. [2024-11-17 00:08:47,252 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 377 transitions. Word has length 16 [2024-11-17 00:08:47,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:08:47,252 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 377 transitions. [2024-11-17 00:08:47,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-17 00:08:47,252 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 377 transitions. [2024-11-17 00:08:47,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:08:47,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:08:47,253 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:08:47,259 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-17 00:08:47,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:08:47,454 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:08:47,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:08:47,455 INFO L85 PathProgramCache]: Analyzing trace with hash 890719150, now seen corresponding path program 1 times [2024-11-17 00:08:47,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:08:47,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [865928237] [2024-11-17 00:08:47,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:08:47,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:08:47,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:08:47,459 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:08:47,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-17 00:08:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:08:47,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:08:47,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:08:47,859 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_19| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_19| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_19|)))) is different from true [2024-11-17 00:08:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:08:47,871 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:08:47,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:08:47,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [865928237] [2024-11-17 00:08:47,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [865928237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:08:47,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:08:47,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:08:47,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897037516] [2024-11-17 00:08:47,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:08:47,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:08:47,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:08:47,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:08:47,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-17 00:08:47,874 INFO L87 Difference]: Start difference. First operand 293 states and 377 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-17 00:08:52,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:08:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:08:52,681 INFO L93 Difference]: Finished difference Result 374 states and 479 transitions. [2024-11-17 00:08:52,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:08:52,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2024-11-17 00:08:52,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:08:52,690 INFO L225 Difference]: With dead ends: 374 [2024-11-17 00:08:52,690 INFO L226 Difference]: Without dead ends: 371 [2024-11-17 00:08:52,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-17 00:08:52,691 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 91 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 364 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-17 00:08:52,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 492 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 1 Unknown, 364 Unchecked, 4.8s Time] [2024-11-17 00:08:52,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-17 00:08:52,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 344. [2024-11-17 00:08:52,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 338 states have (on average 1.2899408284023668) internal successors, (436), 339 states have internal predecessors, (436), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:08:52,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 442 transitions. [2024-11-17 00:08:52,722 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 442 transitions. Word has length 16 [2024-11-17 00:08:52,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:08:52,722 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 442 transitions. [2024-11-17 00:08:52,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-17 00:08:52,724 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 442 transitions. [2024-11-17 00:08:52,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-17 00:08:52,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:08:52,728 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:08:52,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-17 00:08:52,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:08:52,929 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:08:52,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:08:52,930 INFO L85 PathProgramCache]: Analyzing trace with hash -506857772, now seen corresponding path program 1 times [2024-11-17 00:08:52,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:08:52,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329804011] [2024-11-17 00:08:52,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:08:52,931 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:08:52,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:08:52,932 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:08:52,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-17 00:08:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:08:53,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:08:53,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:08:53,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:08:53,217 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:08:53,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:08:53,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329804011] [2024-11-17 00:08:53,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329804011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:08:53,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:08:53,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:08:53,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435036585] [2024-11-17 00:08:53,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:08:53,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:08:53,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:08:53,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:08:53,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:08:53,219 INFO L87 Difference]: Start difference. First operand 344 states and 442 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-17 00:08:57,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:09:00,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:09:00,322 INFO L93 Difference]: Finished difference Result 382 states and 487 transitions. [2024-11-17 00:09:00,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:09:00,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2024-11-17 00:09:00,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:09:00,328 INFO L225 Difference]: With dead ends: 382 [2024-11-17 00:09:00,328 INFO L226 Difference]: Without dead ends: 377 [2024-11-17 00:09:00,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:09:00,329 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 155 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:09:00,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 759 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2024-11-17 00:09:00,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-17 00:09:00,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 342. [2024-11-17 00:09:00,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 336 states have (on average 1.2886904761904763) internal successors, (433), 337 states have internal predecessors, (433), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:09:00,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 439 transitions. [2024-11-17 00:09:00,343 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 439 transitions. Word has length 26 [2024-11-17 00:09:00,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:09:00,343 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 439 transitions. [2024-11-17 00:09:00,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-17 00:09:00,343 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 439 transitions. [2024-11-17 00:09:00,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-17 00:09:00,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:09:00,344 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] [2024-11-17 00:09:00,350 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-17 00:09:00,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:09:00,545 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:09:00,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:09:00,546 INFO L85 PathProgramCache]: Analyzing trace with hash -165100491, now seen corresponding path program 1 times [2024-11-17 00:09:00,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:09:00,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268673077] [2024-11-17 00:09:00,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:09:00,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:09:00,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:09:00,548 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:09:00,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-17 00:09:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:09:00,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:09:00,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:00,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:09:00,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:09:00,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:09:00,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268673077] [2024-11-17 00:09:00,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268673077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:09:00,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:09:00,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:09:00,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340712734] [2024-11-17 00:09:00,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:09:00,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:09:00,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:09:00,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:09:00,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:09:00,759 INFO L87 Difference]: Start difference. First operand 342 states and 439 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-17 00:09:00,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:09:00,866 INFO L93 Difference]: Finished difference Result 351 states and 424 transitions. [2024-11-17 00:09:00,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:09:00,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 50 [2024-11-17 00:09:00,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:09:00,868 INFO L225 Difference]: With dead ends: 351 [2024-11-17 00:09:00,868 INFO L226 Difference]: Without dead ends: 351 [2024-11-17 00:09:00,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:09:00,870 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 36 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:09:00,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 663 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:09:00,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-17 00:09:00,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2024-11-17 00:09:00,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 345 states have (on average 1.2115942028985507) internal successors, (418), 346 states have internal predecessors, (418), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:09:00,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 424 transitions. [2024-11-17 00:09:00,880 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 424 transitions. Word has length 50 [2024-11-17 00:09:00,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:09:00,880 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 424 transitions. [2024-11-17 00:09:00,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-17 00:09:00,880 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 424 transitions. [2024-11-17 00:09:00,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-17 00:09:00,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:09:00,882 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] [2024-11-17 00:09:00,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-17 00:09:01,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:09:01,083 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:09:01,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:09:01,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1395250197, now seen corresponding path program 1 times [2024-11-17 00:09:01,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:09:01,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689387276] [2024-11-17 00:09:01,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:09:01,084 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:09:01,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:09:01,086 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:09:01,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-17 00:09:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:09:01,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:09:01,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:01,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:09:01,332 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:09:01,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:09:01,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689387276] [2024-11-17 00:09:01,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689387276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:09:01,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:09:01,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:09:01,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671571287] [2024-11-17 00:09:01,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:09:01,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:09:01,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:09:01,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:09:01,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:09:01,337 INFO L87 Difference]: Start difference. First operand 351 states and 424 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-17 00:09:01,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:09:01,424 INFO L93 Difference]: Finished difference Result 333 states and 394 transitions. [2024-11-17 00:09:01,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:09:01,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 50 [2024-11-17 00:09:01,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:09:01,426 INFO L225 Difference]: With dead ends: 333 [2024-11-17 00:09:01,426 INFO L226 Difference]: Without dead ends: 333 [2024-11-17 00:09:01,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:09:01,428 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 9 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 664 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.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:09:01,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 664 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:09:01,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-17 00:09:01,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2024-11-17 00:09:01,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 327 states have (on average 1.1865443425076452) internal successors, (388), 328 states have internal predecessors, (388), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:09:01,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 394 transitions. [2024-11-17 00:09:01,435 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 394 transitions. Word has length 50 [2024-11-17 00:09:01,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:09:01,436 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 394 transitions. [2024-11-17 00:09:01,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-17 00:09:01,436 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 394 transitions. [2024-11-17 00:09:01,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-17 00:09:01,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:09:01,437 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] [2024-11-17 00:09:01,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-17 00:09:01,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:09:01,642 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:09:01,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:09:01,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1735730449, now seen corresponding path program 1 times [2024-11-17 00:09:01,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:09:01,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409241422] [2024-11-17 00:09:01,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:09:01,644 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:09:01,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:09:01,647 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:09:01,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-17 00:09:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:09:01,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 00:09:01,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:01,883 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:09:01,884 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:09:01,885 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:09:01,891 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-17 00:09:01,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:09:01,977 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-17 00:09:02,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:09:02,034 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:09:02,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:09:02,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409241422] [2024-11-17 00:09:02,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409241422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:09:02,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:09:02,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:09:02,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204625548] [2024-11-17 00:09:02,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:09:02,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:09:02,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:09:02,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:09:02,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:09:02,036 INFO L87 Difference]: Start difference. First operand 333 states and 394 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-17 00:09:02,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:09:02,640 INFO L93 Difference]: Finished difference Result 340 states and 412 transitions. [2024-11-17 00:09:02,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:09:02,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 50 [2024-11-17 00:09:02,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:09:02,643 INFO L225 Difference]: With dead ends: 340 [2024-11-17 00:09:02,643 INFO L226 Difference]: Without dead ends: 337 [2024-11-17 00:09:02,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:09:02,644 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 110 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:09:02,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1006 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 00:09:02,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-17 00:09:02,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 289. [2024-11-17 00:09:02,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 283 states have (on average 1.2084805653710247) internal successors, (342), 284 states have internal predecessors, (342), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:09:02,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 348 transitions. [2024-11-17 00:09:02,653 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 348 transitions. Word has length 50 [2024-11-17 00:09:02,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:09:02,653 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 348 transitions. [2024-11-17 00:09:02,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-17 00:09:02,653 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 348 transitions. [2024-11-17 00:09:02,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-17 00:09:02,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:09:02,655 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:09:02,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-17 00:09:02,857 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-17 00:09:02,857 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:09:02,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:09:02,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1508864162, now seen corresponding path program 1 times [2024-11-17 00:09:02,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:09:02,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012594391] [2024-11-17 00:09:02,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:09:02,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:09:02,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:09:02,862 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-17 00:09:02,863 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-17 00:09:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:09:03,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:09:03,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:09:03,328 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:09:03,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:09:03,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012594391] [2024-11-17 00:09:03,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012594391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:09:03,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:09:03,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:09:03,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752425] [2024-11-17 00:09:03,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:09:03,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:09:03,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:09:03,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:09:03,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:09:03,330 INFO L87 Difference]: Start difference. First operand 289 states and 348 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:09:03,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:09:03,429 INFO L93 Difference]: Finished difference Result 295 states and 338 transitions. [2024-11-17 00:09:03,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:09:03,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2024-11-17 00:09:03,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:09:03,431 INFO L225 Difference]: With dead ends: 295 [2024-11-17 00:09:03,431 INFO L226 Difference]: Without dead ends: 295 [2024-11-17 00:09:03,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:09:03,432 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 30 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:09:03,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 622 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:09:03,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-17 00:09:03,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2024-11-17 00:09:03,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 289 states have (on average 1.1487889273356402) internal successors, (332), 290 states have internal predecessors, (332), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:09:03,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 338 transitions. [2024-11-17 00:09:03,441 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 338 transitions. Word has length 88 [2024-11-17 00:09:03,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:09:03,442 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 338 transitions. [2024-11-17 00:09:03,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:09:03,442 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 338 transitions. [2024-11-17 00:09:03,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-17 00:09:03,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:09:03,444 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:09:03,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-17 00:09:03,644 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-17 00:09:03,645 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:09:03,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:09:03,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1150870500, now seen corresponding path program 1 times [2024-11-17 00:09:03,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:09:03,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [18299602] [2024-11-17 00:09:03,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:09:03,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:09:03,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:09:03,647 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:09:03,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-17 00:09:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:09:04,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:09:04,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:04,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:09:04,127 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:09:04,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:09:04,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [18299602] [2024-11-17 00:09:04,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [18299602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:09:04,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:09:04,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:09:04,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705205940] [2024-11-17 00:09:04,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:09:04,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:09:04,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:09:04,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:09:04,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:09:04,130 INFO L87 Difference]: Start difference. First operand 295 states and 338 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:09:04,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:09:04,164 INFO L93 Difference]: Finished difference Result 298 states and 342 transitions. [2024-11-17 00:09:04,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:09:04,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 88 [2024-11-17 00:09:04,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:09:04,169 INFO L225 Difference]: With dead ends: 298 [2024-11-17 00:09:04,169 INFO L226 Difference]: Without dead ends: 298 [2024-11-17 00:09:04,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:09:04,171 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 0 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:09:04,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 686 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:09:04,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-17 00:09:04,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2024-11-17 00:09:04,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 291 states have (on average 1.1512027491408934) internal successors, (335), 293 states have internal predecessors, (335), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:09:04,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 342 transitions. [2024-11-17 00:09:04,178 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 342 transitions. Word has length 88 [2024-11-17 00:09:04,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:09:04,179 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 342 transitions. [2024-11-17 00:09:04,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:09:04,179 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 342 transitions. [2024-11-17 00:09:04,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-17 00:09:04,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:09:04,180 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:09:04,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-17 00:09:04,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:09:04,385 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:09:04,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:09:04,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1354442664, now seen corresponding path program 1 times [2024-11-17 00:09:04,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:09:04,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [870770431] [2024-11-17 00:09:04,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:09:04,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:09:04,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:09:04,389 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:09:04,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-17 00:09:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:09:04,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:09:04,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:04,832 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:09:04,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:09:04,921 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:09:04,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:09:04,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [870770431] [2024-11-17 00:09:04,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [870770431] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:09:04,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:09:04,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-17 00:09:04,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829605373] [2024-11-17 00:09:04,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:09:04,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:09:04,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:09:04,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:09:04,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:09:04,924 INFO L87 Difference]: Start difference. First operand 298 states and 342 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:09:05,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:09:05,068 INFO L93 Difference]: Finished difference Result 309 states and 358 transitions. [2024-11-17 00:09:05,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:09:05,069 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 90 [2024-11-17 00:09:05,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:09:05,072 INFO L225 Difference]: With dead ends: 309 [2024-11-17 00:09:05,072 INFO L226 Difference]: Without dead ends: 309 [2024-11-17 00:09:05,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:09:05,073 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 4 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:09:05,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1139 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:09:05,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-17 00:09:05,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2024-11-17 00:09:05,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 299 states have (on average 1.1672240802675586) internal successors, (349), 301 states have internal predecessors, (349), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:09:05,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 356 transitions. [2024-11-17 00:09:05,081 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 356 transitions. Word has length 90 [2024-11-17 00:09:05,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:09:05,081 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 356 transitions. [2024-11-17 00:09:05,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:09:05,082 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 356 transitions. [2024-11-17 00:09:05,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-17 00:09:05,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:09:05,083 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:09:05,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-17 00:09:05,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:09:05,284 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:09:05,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:09:05,284 INFO L85 PathProgramCache]: Analyzing trace with hash 619323940, now seen corresponding path program 2 times [2024-11-17 00:09:05,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:09:05,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444833076] [2024-11-17 00:09:05,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:09:05,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:09:05,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:09:05,286 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:09:05,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-17 00:09:05,558 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 00:09:05,558 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:09:05,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:09:05,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:05,624 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-17 00:09:05,624 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:09:05,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:09:05,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444833076] [2024-11-17 00:09:05,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444833076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:09:05,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:09:05,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:09:05,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411369772] [2024-11-17 00:09:05,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:09:05,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:09:05,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:09:05,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:09:05,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:09:05,626 INFO L87 Difference]: Start difference. First operand 307 states and 356 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:09:10,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:09:14,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:09:16,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:09:16,345 INFO L93 Difference]: Finished difference Result 443 states and 521 transitions. [2024-11-17 00:09:16,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:09:16,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 94 [2024-11-17 00:09:16,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:09:16,349 INFO L225 Difference]: With dead ends: 443 [2024-11-17 00:09:16,349 INFO L226 Difference]: Without dead ends: 443 [2024-11-17 00:09:16,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:09:16,350 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 488 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:09:16,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 401 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 122 Invalid, 2 Unknown, 0 Unchecked, 10.7s Time] [2024-11-17 00:09:16,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-17 00:09:16,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 415. [2024-11-17 00:09:16,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 406 states have (on average 1.1699507389162562) internal successors, (475), 408 states have internal predecessors, (475), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:09:16,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 485 transitions. [2024-11-17 00:09:16,362 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 485 transitions. Word has length 94 [2024-11-17 00:09:16,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:09:16,363 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 485 transitions. [2024-11-17 00:09:16,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:09:16,363 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 485 transitions. [2024-11-17 00:09:16,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-17 00:09:16,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:09:16,365 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:09:16,370 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-17 00:09:16,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:09:16,566 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:09:16,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:09:16,567 INFO L85 PathProgramCache]: Analyzing trace with hash -2114735670, now seen corresponding path program 1 times [2024-11-17 00:09:16,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:09:16,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969846798] [2024-11-17 00:09:16,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:09:16,568 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:09:16,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:09:16,569 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:09:16,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-17 00:09:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:09:17,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:09:17,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:17,270 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-17 00:09:17,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:09:17,658 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-17 00:09:17,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:09:17,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969846798] [2024-11-17 00:09:17,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969846798] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:09:17,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:09:17,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-17 00:09:17,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351431469] [2024-11-17 00:09:17,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:09:17,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 00:09:17,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:09:17,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 00:09:17,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:09:17,660 INFO L87 Difference]: Start difference. First operand 415 states and 485 transitions. Second operand has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:09:18,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:09:18,370 INFO L93 Difference]: Finished difference Result 430 states and 508 transitions. [2024-11-17 00:09:18,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 00:09:18,372 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 104 [2024-11-17 00:09:18,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:09:18,373 INFO L225 Difference]: With dead ends: 430 [2024-11-17 00:09:18,373 INFO L226 Difference]: Without dead ends: 426 [2024-11-17 00:09:18,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-17 00:09:18,374 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 7 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:09:18,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1823 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:09:18,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-17 00:09:18,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 424. [2024-11-17 00:09:18,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 415 states have (on average 1.1734939759036145) internal successors, (487), 417 states have internal predecessors, (487), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:09:18,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 497 transitions. [2024-11-17 00:09:18,387 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 497 transitions. Word has length 104 [2024-11-17 00:09:18,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:09:18,387 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 497 transitions. [2024-11-17 00:09:18,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:09:18,388 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 497 transitions. [2024-11-17 00:09:18,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-17 00:09:18,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:09:18,389 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:09:18,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-17 00:09:18,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:09:18,590 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:09:18,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:09:18,590 INFO L85 PathProgramCache]: Analyzing trace with hash 605258184, now seen corresponding path program 2 times [2024-11-17 00:09:18,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:09:18,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136280757] [2024-11-17 00:09:18,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:09:18,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:09:18,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:09:18,595 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:09:18,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-17 00:09:19,096 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:09:19,096 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:09:19,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 00:09:19,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:19,281 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 71 proven. 55 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-17 00:09:19,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:09:20,084 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 123 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-17 00:09:20,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:09:20,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136280757] [2024-11-17 00:09:20,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136280757] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:09:20,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:09:20,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-17 00:09:20,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923308347] [2024-11-17 00:09:20,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:09:20,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 00:09:20,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:09:20,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 00:09:20,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-17 00:09:20,088 INFO L87 Difference]: Start difference. First operand 424 states and 497 transitions. Second operand has 26 states, 26 states have (on average 4.653846153846154) internal successors, (121), 26 states have internal predecessors, (121), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:09:22,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:09:22,991 INFO L93 Difference]: Finished difference Result 448 states and 538 transitions. [2024-11-17 00:09:22,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-17 00:09:22,993 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.653846153846154) internal successors, (121), 26 states have internal predecessors, (121), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 113 [2024-11-17 00:09:22,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:09:22,995 INFO L225 Difference]: With dead ends: 448 [2024-11-17 00:09:22,995 INFO L226 Difference]: Without dead ends: 444 [2024-11-17 00:09:22,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-17 00:09:22,997 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 13 mSDsluCounter, 2511 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2741 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:09:22,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2741 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-17 00:09:22,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-17 00:09:23,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 442. [2024-11-17 00:09:23,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 433 states have (on average 1.1801385681293302) internal successors, (511), 435 states have internal predecessors, (511), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:09:23,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 521 transitions. [2024-11-17 00:09:23,010 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 521 transitions. Word has length 113 [2024-11-17 00:09:23,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:09:23,011 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 521 transitions. [2024-11-17 00:09:23,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.653846153846154) internal successors, (121), 26 states have internal predecessors, (121), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:09:23,011 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 521 transitions. [2024-11-17 00:09:23,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-17 00:09:23,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:09:23,012 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:09:23,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-17 00:09:23,213 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-17 00:09:23,213 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:09:23,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:09:23,214 INFO L85 PathProgramCache]: Analyzing trace with hash -757870840, now seen corresponding path program 3 times [2024-11-17 00:09:23,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:09:23,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508787766] [2024-11-17 00:09:23,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 00:09:23,215 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:09:23,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:09:23,217 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-17 00:09:23,218 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-17 00:09:23,778 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-17 00:09:23,778 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:09:23,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:09:23,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:23,904 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2024-11-17 00:09:23,905 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:09:23,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:09:23,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508787766] [2024-11-17 00:09:23,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508787766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:09:23,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:09:23,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:09:23,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400540115] [2024-11-17 00:09:23,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:09:23,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:09:23,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:09:23,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:09:23,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:09:23,907 INFO L87 Difference]: Start difference. First operand 442 states and 521 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:09:28,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:09:32,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:09:35,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:09:35,465 INFO L93 Difference]: Finished difference Result 445 states and 524 transitions. [2024-11-17 00:09:35,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:09:35,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 131 [2024-11-17 00:09:35,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:09:35,469 INFO L225 Difference]: With dead ends: 445 [2024-11-17 00:09:35,469 INFO L226 Difference]: Without dead ends: 445 [2024-11-17 00:09:35,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:09:35,470 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 205 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:09:35,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 415 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 2 Unknown, 0 Unchecked, 11.5s Time] [2024-11-17 00:09:35,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-17 00:09:35,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 443. [2024-11-17 00:09:35,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 434 states have (on average 1.1797235023041475) internal successors, (512), 436 states have internal predecessors, (512), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:09:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 522 transitions. [2024-11-17 00:09:35,481 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 522 transitions. Word has length 131 [2024-11-17 00:09:35,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:09:35,482 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 522 transitions. [2024-11-17 00:09:35,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:09:35,482 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 522 transitions. [2024-11-17 00:09:35,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-17 00:09:35,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:09:35,484 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:09:35,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-17 00:09:35,685 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-17 00:09:35,685 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:09:35,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:09:35,686 INFO L85 PathProgramCache]: Analyzing trace with hash 129632841, now seen corresponding path program 1 times [2024-11-17 00:09:35,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:09:35,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875569217] [2024-11-17 00:09:35,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:09:35,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:09:35,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:09:35,689 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:09:35,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-17 00:09:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:09:36,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-17 00:09:36,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:36,933 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 281 proven. 253 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-17 00:09:36,933 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:09:38,690 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 2 proven. 531 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-17 00:09:38,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:09:38,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875569217] [2024-11-17 00:09:38,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875569217] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:09:38,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:09:38,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-17 00:09:38,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941975487] [2024-11-17 00:09:38,691 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:09:38,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-17 00:09:38,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:09:38,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-17 00:09:38,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-17 00:09:38,694 INFO L87 Difference]: Start difference. First operand 443 states and 522 transitions. Second operand has 50 states, 50 states have (on average 2.9) internal successors, (145), 50 states have internal predecessors, (145), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:09:45,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:09:45,725 INFO L93 Difference]: Finished difference Result 483 states and 595 transitions. [2024-11-17 00:09:45,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-17 00:09:45,726 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.9) internal successors, (145), 50 states have internal predecessors, (145), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 131 [2024-11-17 00:09:45,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:09:45,728 INFO L225 Difference]: With dead ends: 483 [2024-11-17 00:09:45,728 INFO L226 Difference]: Without dead ends: 479 [2024-11-17 00:09:45,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-17 00:09:45,732 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 25 mSDsluCounter, 5473 mSDsCounter, 0 mSdLazyCounter, 1958 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5703 SdHoareTripleChecker+Invalid, 2017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:09:45,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5703 Invalid, 2017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1958 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-17 00:09:45,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-11-17 00:09:45,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 477. [2024-11-17 00:09:45,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 468 states have (on average 1.1923076923076923) internal successors, (558), 470 states have internal predecessors, (558), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:09:45,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 568 transitions. [2024-11-17 00:09:45,742 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 568 transitions. Word has length 131 [2024-11-17 00:09:45,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:09:45,743 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 568 transitions. [2024-11-17 00:09:45,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.9) internal successors, (145), 50 states have internal predecessors, (145), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:09:45,743 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 568 transitions. [2024-11-17 00:09:45,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-17 00:09:45,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:09:45,745 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:09:45,764 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-17 00:09:45,945 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-17 00:09:45,946 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:09:45,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:09:45,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2111108087, now seen corresponding path program 2 times [2024-11-17 00:09:45,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:09:45,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142963804] [2024-11-17 00:09:45,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:09:45,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:09:45,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:09:45,949 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-17 00:09:45,950 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-17 00:09:47,101 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:09:47,101 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:09:47,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 1257 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-17 00:09:47,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:47,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2024-11-17 00:09:47,756 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:09:49,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2024-11-17 00:09:49,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:09:49,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142963804] [2024-11-17 00:09:49,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2142963804] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:09:49,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:09:49,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-17 00:09:49,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005720430] [2024-11-17 00:09:49,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:09:49,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-17 00:09:49,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:09:49,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-17 00:09:49,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-17 00:09:49,802 INFO L87 Difference]: Start difference. First operand 477 states and 568 transitions. Second operand has 52 states, 52 states have (on average 2.75) internal successors, (143), 52 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)